Copertina

Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Boman, Erik, Hendrickson, Bruce, Vavasis, Stephen
Natura:	Preprint
Pubblicazione:	2004
Soggetti:	Numerical Analysis F.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
di: Spielman, Daniel A., et al.
Pubblicazione: (2006)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
di: Spielman, Daniel A., et al.
Pubblicazione: (2003)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
di: Farfan, Angelo, et al.
Pubblicazione: (2025)

Stable Iterative Solvers for Ill-conditioned Linear Systems
di: Kalantzis, Vasileios, et al.
Pubblicazione: (2025)

Parameter optimization for restarted mixed precision iterative sparse solver
di: Prolubnikov, Alexander V.
Pubblicazione: (2024)

An algorithm for two-dimensional mesh generation based on the pinwheel tiling
di: Ganguly, Pritam, et al.
Pubblicazione: (2004)

Adaptive time-stepping for aggregation-shattering kinetics
di: Matveev, Sergey A., et al.
Pubblicazione: (2024)

Deterministic complexity analysis of Hermitian eigenproblems
di: Sobczyk, Aleksandros
Pubblicazione: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
di: Sobczyk, Aleksandros, et al.
Pubblicazione: (2023)

Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
di: Ramakrishna, P. H. D., et al.
Pubblicazione: (2003)

Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
di: Coelho, D. F. G., et al.
Pubblicazione: (2024)

Recurrence relations and fast algorithms
di: Tygert, Mark
Pubblicazione: (2006)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
di: Dunagan, John, et al.
Pubblicazione: (2003)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
di: Shao, Xuancheng, et al.
Pubblicazione: (2007)

An SMT Formalization of Mixed-Precision Matrix Multiplication: Modeling Three Generations of Tensor Cores
di: Valpey, Benjamin, et al.
Pubblicazione: (2025)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2023)

Entrywise Approximation for Matrix Inversion and Linear Systems
di: Ghadiri, Mehrdad, et al.
Pubblicazione: (2025)

A Bernstein-Bezier Sufficient Condition for Invertibility of Polynomial Mapping Functions
di: Vavasis, Stephen
Pubblicazione: (2003)

On infinite matrices
di: Vasilyev, Alexander, et al.
Pubblicazione: (2024)

Inexact Gauss Seidel and Coarse Solvers for AMG and s-step CG
di: Thomas, Stephen, et al.
Pubblicazione: (2025)

Spectrally Adapted Physics-Informed Neural Networks for Solving Unbounded Domain Problems
di: Xia, Mingtao, et al.
Pubblicazione: (2022)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
di: Koiran, Pascal, et al.
Pubblicazione: (2022)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
di: Eberly, Wayne, et al.
Pubblicazione: (2007)

Certification of the QR factor R, and of lattice basis reducedness
di: Villard, Gilles
Pubblicazione: (2007)

Does block size matter in randomized block Krylov low-rank approximation?
di: Chen, Tyler, et al.
Pubblicazione: (2025)

Flexible Quaternion Generalized Minimal Residual Method for Ill-Posed Quaternion Inverse Problems
di: Liu, Xuan, et al.
Pubblicazione: (2024)

Complexity of Sparse Polynomial Solving 2: Renormalization
di: Malajovich, Gregorio
Pubblicazione: (2020)

Constructing Orthogonal Rational Function Vectors with an application in Rational Approximation
di: Vermeiren, Robbe
Pubblicazione: (2026)

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
di: Kao, Ming-Yang, et al.
Pubblicazione: (1999)

Model-Based Learning of Whittle indices
di: Charles-Rebuffé, Joël, et al.
Pubblicazione: (2025)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
di: Bhattacharjee, Rajarshi, et al.
Pubblicazione: (2024)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
di: Koiran, Pascal, et al.
Pubblicazione: (2024)

Generalized Fractional Repetition Codes for Binary Coded Computations
di: Charalambides, Neophytos, et al.
Pubblicazione: (2021)

PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
di: Suzuki, Kengo, et al.
Pubblicazione: (2026)

Lopsided HSS Iterative Method and Preconditioner for a class of Complex Symmetric Linear System
di: Zhang, Yusong, et al.
Pubblicazione: (2025)

Critical phase transitions in minimum-energy configurations for the exponential kernel family $e^{-|x-y|^q}$ on the unit interval
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

Per-antenna power constraints: constructing Pareto-optimal precoders with cubic complexity under non-negligible noise conditions
di: Petrov, Sergey, et al.
Pubblicazione: (2025)

Pauli-structured preconditioning for quantum linear system solvers
di: Nie, Hantao, et al.
Pubblicazione: (2026)

Application of Sensitivity Analysis Methods for Studying Neural Network Models
di: Miao, Jiaxuan, et al.
Pubblicazione: (2025)

A Space-Time Continuous Galerkin Finite Element Method for Linear Schrödinger Equations
di: Zank, Marco
Pubblicazione: (2025)