High-precision randomized preconditioned iterative methods for the random feature method
From MaRDI portal
Cites work
- A fast block coordinate descent method for solving linear least-squares problems
- A fast randomized algorithm for overdetermined linear least-squares regression
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Bridging traditional and machine learning-based algorithms for solving PDEs: the random feature method
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- DGM: a deep learning algorithm for solving partial differential equations
- Direct Methods for Sparse Linear Systems
- Faster least squares approximation
- Finding frequent items in data streams
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Improved analysis of the subsampled randomized Hadamard transform
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Low-rank approximation and regression in input sparsity time
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Meshless methods: a review and computer implementation aspects
- Methods of conjugate gradients for solving linear systems
- Metric-based upscaling
- Numerical methods for solving linear least squares problems
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- On greedy randomized coordinate descent methods for solving large linear least-squares problems.
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Optimization of random feature method in the high-precision regime
- Parallel Preconditioning with Sparse Approximate Inverses
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Preconditioning techniques for large linear systems: A survey
- Randomized extended Kaczmarz for solving least squares
- Randomized Kaczmarz solver for noisy linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Sketching as a tool for numerical linear algebra
- The deep Ritz method: a deep learning-based numerical algorithm for solving variational problems
- The random feature method for solving interface problems
- The Random Feature Method for Time-Dependent Problems
- The University of Florida sparse matrix collection
- Weak adversarial networks for high-dimensional partial differential equations
Cited in
(2)
This page was built for publication: High-precision randomized preconditioned iterative methods for the random feature method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857394)
