A fast direct solver for elliptic problems on general meshes in 2D
From MaRDI portal
Publication:422952
DOI10.1016/j.jcp.2011.10.013zbMath1408.65022OpenAlexW2106150226MaRDI QIDQ422952
Lexing Ying, Phillip G. Schmitz
Publication date: 18 May 2012
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2011.10.013
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
A multilevel approach for trace system in HDG discretizations, A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements, Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator, Linear-scaling selected inversion based on hierarchical interpolative factorization for self Green's function for modified Poisson-Boltzmann equation in two dimensions, A fast block low-rank dense solver with applications to finite-element matrices, Hierarchical orthogonal factorization: sparse least squares problems, Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case, Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations, A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices, Solution of the 3D-Helmholtz equation in exterior domains using spherical harmonic decomposition, Distributed-memory hierarchical interpolative factorization, Fast Sparse Selected Inversion, On preconditioners for the Laplace double-layer in 2D, A direct solver for variable coefficient elliptic PDEs discretized via a composite spectral collocation method, A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions, A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices, An \(O(N)\) algorithm for constructing the solution operator to 2D elliptic boundary value problems in the absence of body loads, Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems, Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs, \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices, An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations, An Adaptive High Order Direct Solution Technique for Elliptic Boundary Value Problems, An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation, A direct solver with reutilization of Lu factorizations for \(h\)-adaptive finite element grids with point singularities, A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains, A parallel shared-memory implementation of a high-order accurate solution technique for variable coefficient Helmholtz problems, Direct solvers performance on \(h\)-adapted grids, A spectrally accurate direct solution technique for frequency-domain scattering problems with variable media, Intrinsic Complexity and Scaling Laws: From Random Fields to Random Vectors, A convergent Born series for solving the inhomogeneous Helmholtz equation in arbitrarily large media, An \(O(N)\) direct solver for integral equations on the plane, A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators, \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian, Subspace Iteration Randomization and Singular Value Problems, Interconnected hierarchical structures for fast direct elliptic solution, Hierarchical Orthogonal Factorization: Sparse Square Matrices
Uses Software
Cites Work
- Unnamed Item
- A fast direct solver for a class of elliptic partial differential equations
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices
- A fast direct solver for boundary integral equations in two dimensions
- Randomized algorithms for the low-rank approximation of matrices
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- Direct Methods for Sparse Linear Systems
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Fast direct solvers for integral equations in complex three-dimensional domains
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Improving the Run Time and Quality of Nested Dissection Ordering
- Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems
- Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
- An Approximate Minimum Degree Ordering Algorithm
- Computing with hp-ADAPTIVE FINITE ELEMENTS
- Nested Dissection of a Regular Finite Element Mesh
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
