Fast Multiresolution Algorithms for Solving Linear Equations: A Comparative Study
From MaRDI portal
algorithmscollocationdiscrete multiresolution analysisfinite differenceFredholm integral equationmatrix compressionwavelet transform
General harmonic expansions, frames (42C15) Computational methods for sparse matrices (65F50) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Numerical methods for integral equations (65R20) Numerical methods for trigonometric approximation and interpolation (65T40)
Recommendations
- Fast recursive algorithms for a class of linear equations
- Fast Multiresolution Algorithms for Matrix-Vector Multiplication
- scientific article; zbMATH DE number 1855626
- Parallelism and fast solution of linear systems
- Fast and efficient parallel solution of dense linear systems
- Superfast iterative solvers for linear matrix equations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- A fast and efficient algorithm for solving ill-conditioned linear systems
- On Accelerated Iterative Methods for the Solution of Systems of Linear Equations
- A new algorithm for parallel solution of linear equations
Cited in
(4)- A multiresolution strategy for numerical homogenization
- Multiresolution algorithms for the numerical solution of hyperbolic conservation laws
- Multiresolution approach to the approximation of the leading eigenelements of some neutron transport operators
- Reconstructions that combine interpolation with least squares fitting
This page was built for publication: Fast Multiresolution Algorithms for Solving Linear Equations: A Comparative Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837898)
