scientific article

zbMath0746.65041MaRDI QIDQ4001836

Zahari Zlatev

Publication date: 18 September 1992

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

zbMATH Keywords

monographbibliographynumerical testsparallel algorithmsLU factorizationconjugate gradientsleast squares problemsQR factorizationiterative refinementpivoting strategiesstorage schemescondition number estimatorscomputer-oriented exploitation of sparsitysmall fill-ins

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ Numerical methods for the solution of large kinetic systems ⋮ The preconditioned conjugate gradient method with incomplete factorization preconditioners ⋮ TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗ ⋮ Improving the numerical stability and the performance of a parallel sparse solver ⋮ Learning short multivariate time series models through evolutionary and sparse matrix computation ⋮ Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations ⋮ A decomposition procedure for nearly-symmetric matrices with applications to some nonlinear problems ⋮ A new family of preconditioned iterative solvers for nonsymmetric linear systems ⋮ Iterative refinement using splitting methods ⋮ Efficient implementation of stable Richardson extrapolation algorithms ⋮ Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module ⋮ Explicit Runge-Kutta methods combined with advanced versions of the Richardson extrapolation ⋮ Solving systems of elastic bar structures by preconditioned conjugate gradient method ⋮ Milestones in the development of iterative solution methods ⋮ Robust incomplete factorization for nonsymmetric matrices ⋮ Partitioning ODE systems with an application to air pollution models ⋮ Parallelization of Advection-Diffusion-Chemistry Modules ⋮ Unnamed Item ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ A class of incomplete orthogonal factorization methods. II: Implemetation and results ⋮ Recognizing badly presented \(Z\)-modules ⋮ Wavelet based preconditioners for sparse linear systems ⋮ Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation

This page was built for publication: