Matrix-free preconditioning using partial matrix estimation
From MaRDI portal
Publication:855287
DOI10.1007/S10543-006-0094-8zbMATH Open1105.65046OpenAlexW2067381027MaRDI QIDQ855287FDOQ855287
Publication date: 5 January 2007
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-006-0094-8
Recommendations
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Matrix-free interior point method
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- Stochastic matrix-free equilibration
- Matrix-free iterative solution strategies for large dense linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Algorithm 809: PREQN
- ILUT: A dual threshold incomplete LU factorization
- Iterative Solution Methods
- Title not available (Why is that?)
- Solving Nonlinear Equations with Newton's Method
- Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Estimation of sparse hessian matrices and graph coloring problems
- A class of first order factorization methods
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Title not available (Why is that?)
- Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
- A robust incomplete Choleski-conjugate gradient algorithm
- Some bounds on the complexity of gradients, Jacobians, and Hessians
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- A scalable parallel algorithm for incomplete factor preconditioning
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Software for estimating sparse Jacobian matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Diagonally compensated reduction and related preconditioning methods
- Title not available (Why is that?)
- MATRIX-FREE NUMERICAL CONTINUATION AND BIFURCATION*
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Matrix probing: a randomized preconditioner for the wave-equation Hessian
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Effective matrix-free preconditioning for the augmented immersed interface method
- Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation
- Difference filter preconditioning for large covariance matrices
- A preconditioner for least-squares distributed parameter estimation
Uses Software
This page was built for publication: Matrix-free preconditioning using partial matrix estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855287)
