Problems of parallel solution of large systems of linear algebraic equations
DOI10.1007/S10958-016-2945-4zbMATH Open1347.65064OpenAlexW2467772279MaRDI QIDQ308680FDOQ308680
Publication date: 6 September 2016
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-016-2945-4
sparse matricesconvergencepreconditioningiterationKrylov subspace methodparallel algorithmsalgebraic domain decompositionmultiprocessor computer system
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- Algorithm 913
- Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
- Rational Krylov sequence methods for eigenvalue computation
- Robust domain decomposition preconditioners for abstract symmetric positive definite bilinear forms
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Semi-conjugate direction methods for real positive definite systems
- Eigenvalue bounds and inequalities using vector aggregation of matrices
- The optimized Schwarz method with a coarse grid correction
- On the semi-conjugate direction methods with dynamic preconditioning
- Additive Schwarz with Variable Weights
- An Introduction to Domain Decomposition Methods
- Hierarchische Matrizen
- Deflated and Augmented Krylov Subspace Techniques
- Title not available (Why is that?)
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- A Multipreconditioned Conjugate Gradient Algorithm
- Parallel approaches and technologies of domain decomposition methods
Cited In (8)
- \(D\&C\) method for solving large problems in fixed size processor array
- Parallel algorithms for solving large linear systems
- Title not available (Why is that?)
- Iterative preconditioned methods in Krylov spaces: trends of the 21st century
- Paralleling computations when solving systems of nonlinear algebraic equations
- Title not available (Why is that?)
- SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES
- Title not available (Why is that?)
Uses Software
This page was built for publication: Problems of parallel solution of large systems of linear algebraic equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308680)
