Randomized Sparse Direct Solvers

From MaRDI portal
Revision as of 21:51, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5300552

DOI10.1137/12087116XzbMath1269.65029OpenAlexW2083903752MaRDI QIDQ5300552

Jian-Lin Xia

Publication date: 27 June 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/12087116x




Related Items (37)

SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured MatricesRandomized numerical linear algebra: Foundations and algorithmsEffective matrix-free preconditioning for the augmented immersed interface methodA fast block low-rank dense solver with applications to finite-element matricesHierarchical Interpolative Factorization for Elliptic Operators: Differential EquationsEfficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximationsA constrained spline dynamics (CSD) method for interactive simulation of elastic rodsDistributed-memory hierarchical interpolative factorizationFast Sparse Selected InversionA Fast Contour-Integral Eigensolver for Non-Hermitian MatricesAn Incomplete Cholesky Preconditioner Based on Orthogonal ApproximationsA Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct SolutionsA fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matricesSecond‐order accurate hierarchical approximate factorizations for solving sparse linear systemsOn the application of a hierarchically semi-separable compression for space-fractional parabolic problems with varying time stepsFast Factorization Update for General Elliptic Equations Under Multiple Coefficient UpdatesAn Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank ApproximationsTransformations of matrix structures work againAnalytical Low-Rank Compression via Proxy Point SelectionSparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave EquationsCompressing Rank-Structured Matrices via Randomized SamplingA survey of direct methods for sparse linear systemsLow-Rank Approximation of a Matrix: Novel Insights, New Progress, and ExtensionsParallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficientsAn Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric MatricesA Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable RepresentationsA direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operatorsRandomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector OperationsAn Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized SamplingParallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear SystemsA Low-Rank Schwarz Method for Radiative Transfer Equation With Heterogeneous Scattering CoefficientRobust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable ConstructionSparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave EquationsImproving Multifrontal Methods by Means of Block Low-Rank RepresentationsInterconnected hierarchical structures for fast direct elliptic solutionA Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using RandomizationA Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity







This page was built for publication: Randomized Sparse Direct Solvers