Effective matrix-free preconditioning for the augmented immersed interface method
DOI10.1016/J.JCP.2015.09.050zbMATH Open1349.65112DBLPjournals/jcphy/XiaLY15OpenAlexW2202517823WikidataQ57435032 ScholiaQ57435032MaRDI QIDQ2374867FDOQ2374867
Authors: Jianlin Xia, Xin Ye, Zhilin Li 
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2015.09.050
Recommendations
- A new augmented immersed finite element method without using SVD interpolations
- scientific article; zbMATH DE number 6829640
- Preconditioning immersed isogeometric finite element methods with application to flow problems
- Preconditioning for incompressible flows with free-surfaces and two-fluid interfaces
- An acceleration technique for the augmented IIM for 3D elliptic interface problems
GMRESSchur complement systemaugmented immersed interface methodmatrix-free preconditioningadaptive randomized compressionhierarchically semiseparable structure
Preconditioners for iterative methods (65F08) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cites Work
- The Immersed Interface Method
- Fast algorithms for hierarchically semiseparable matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Numerical solution of saddle point problems
- The immersed boundary method
- A numerical study of electro-migration voiding by evolving level set functions on a fixed Cartesian grid
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
- Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.
- A Fast Iterative Algorithm for Elliptic Interface Problems
- Any Nonincreasing Convergence Curve is Possible for GMRES
- A second-order projection method for the incompressible Navier-Stokes equations
- A semi-implicit augmented IIM for Navier-Stokes equations with open, traction, or free boundary conditions
- Matrix-free interior point method
- A hybrid method for moving interface problems with application to the Hele-Shaw flow
- Reactive autophobic spreading of drops.
- Randomized algorithms for the low-rank approximation of matrices
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- Additive preconditioning for matrix computations
- Randomized preprocessing of homogeneous linear systems of equations
- An augmented approach for Stokes equations with a discontinuous viscosity and singular forces
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- A kernel-free boundary integral method for elliptic boundary value problems
- An augmented method for free boundary problems with moving contact lines
- New finite difference methods based on IIM for inextensible interfaces in incompressible flows.
- Open and traction boundary conditions for the incompressible Navier-Stokes equations
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- Efficient structured multifrontal factorization for general large sparse matrices
- Matrix-free preconditioning using partial matrix estimation
- H-matrix Preconditioners in Convection-Dominated Problems
- A fast randomized algorithm for the approximation of matrices
- On the complexity of some hierarchical structured matrix algorithms
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Randomized sparse direct solvers
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Parallel algebraic hybrid solvers for large 3D convection-diffusion problems
- A fast randomized eigensolver with structured LDL factorization update
- Fine numerical analysis of the crack-tip position for a Mumford-Shah minimizer
- Divide and conquer low-rank preconditioners for symmetric matrices
Cited In (3)
Uses Software
This page was built for publication: Effective matrix-free preconditioning for the augmented immersed interface method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374867)
