Complexity Bounds for Regular Finite Difference and Finite Element Grids
From MaRDI portal
Cited in
(16)- Analysis of dissection algorithms for vector computers
- Separators and structure prediction in sparse orthogonal factorization
- On efficient time-stepping methods for nonlinear partial differential equations
- An \(O(N)\) direct solver for integral equations on the plane
- A direct solver for variable coefficient elliptic PDEs discretized via a composite spectral collocation method
- Optimal Indexing of the Vertices of Graphs
- An adaptive high order direct solution technique for elliptic boundary value problems
- A class of iterative solvers for the Helmholtz equation: factorizations, sweeping preconditioners, source transfer, single layer potentials, polarized traces, and optimized Schwarz methods
- Communication lower bounds and optimal algorithms for numerical linear algebra
- On the efficiency of a class of a-stable methods
- A survey on direct solvers for Galerkin methods
- Acoustic inverse scattering via Helmholtz operator factorization and optimization
- Optimal deployment of indoor wireless local area networks
- A fast direct solver for a class of elliptic partial differential equations
- The method of polarized traces for the 2D Helmholtz equation
- Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
This page was built for publication: Complexity Bounds for Regular Finite Difference and Finite Element Grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5676986)
