scientific article; zbMATH DE number 1439806

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-0887(200001)16:1<57::AID-CNM320>3.0.CO;2-I" /><57::AID-CNM320>3.0.CO;2-I 10.1002/(SICI)1099-0887(200001)16:1<57::AID-CNM320>3.0.CO;2-IzbMath0958.65048MaRDI QIDQ4949930

F. J. Lingen

Publication date: 28 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsparallel computingcomputational efficiencyGram-Schmid orthonormalisation

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Orthogonalization in numerical linear algebra (65F25)

Related Items (7)

Gram-Schmidt orthogonalization: 100 years and more ⋮ Optimal algorithms of Gram-Schmidt type ⋮ Numerical analysis of parallel implementation of the reorthogonalized ABS methods ⋮ Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems ⋮ An efficient parallel procedure for the simulation of crack growth using the cohesive surface methodology ⋮ A massively-parallel electronic-structure calculations based on real-space density functional theory ⋮ Non-overlapping domain decomposition methods in structural mechanics

Cites Work

• Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
• Iterative algorithms for Gram-Schmidt orthogonalization
• The implementation of parallel Gram-Schmidt orthogonalisation algorithms on a ring of transputers
• Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm

This page was built for publication: