scientific article
From MaRDI portal
Publication:3139556
zbMath0793.65011MaRDI QIDQ3139556
Michael T. Heath, Henk A. van der Vorst, James W. Demmel
Publication date: 8 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
singular value decompositioneigenvaluesparallel computingparallel algorithmsleast squaressurvey articledirect and iterative methodsparallel numerical linear algebra
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Parallel numerical computation (65Y05) Numerical linear algebra (65Fxx)
Related Items
Advantages of modal decomposition for efficient scaling of parallel FDTD computations ⋮ To CG or to HDG: a comparative study in 3D ⋮ High performance inverse preconditioning ⋮ A recursive partitioning algorithm for matrix inversion on parallel computers ⋮ The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers ⋮ Direct numerical simulation of turbulence on a Connection Machine CM-5 ⋮ Data-parallel numerical methods in a weather forecast model ⋮ A new family of preconditioned iterative solvers for nonsymmetric linear systems ⋮ Iterative local solvers for distributed Krylov-Schwarz method applied to convection-diffusion problems ⋮ An adaptable parallel algorithm for the direct numerical simulation of incompressible turbulent flows using a Fourier spectral/\textit{hp} element method and MPI virtual topologies ⋮ Parallel algorithms for certain matrix computations ⋮ Explicit approximate inverse preconditioning techniques ⋮ Displacement‐based partitioned equations of motion for structures: Formulation and proof‐of‐concept applications ⋮ Nonnegative matrix factorization with mixed hypergraph regularization for community detection ⋮ A solution approach for lower Hessenberg linear systems ⋮ Communication and information complexity ⋮ GMRES algorithms over 35 years ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ A parallel fast multipole accelerated integral equation scheme for 3D Stokes equations ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ Algorithmic bombardment for the iterative solution of linear systems: A poly-iterative approach
This page was built for publication:
