Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems: Surrogate-based autotuning for randomized sketching algorithms in regression problems

Συγγραφείς: Younghyun Cho, James Demmel, Michał Dereziński, Haoyun Li, Hengrui Luo, Michael Mahoney, Riley Murray

Πηγή: SIAM Journal on Matrix Analysis and Applications, vol 46, iss 2

Θεματικοί όροι: FOS: Computer and information sciences, randomized numerical linear algebra, Computer Science - Machine Learning, Numerical and Computational Mathematics, Numerical solutions to overdetermined systems, pseudoinverses, Computer Science - Artificial Intelligence, Applied Mathematics, autotuning, Randomized algorithms, Numerical & Computational Mathematics, least squares problem, Applied mathematics, 68W20, 65F20, 65Y20, Mathematical Sciences, Machine Learning (cs.LG), Complexity and performance of numerical algorithms, Artificial Intelligence (cs.AI), sketching algorithm, Bayesian optimization

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.15720
https://escholarship.org/uc/item/85s5z8tj
https://escholarship.org/content/qt85s5z8tj/qt85s5z8tj.pdf

Locking-Free Hybrid High-Order Method for Linear Elasticity: Locking-free hybrid high-order method for linear elasticity

Συγγραφείς: Carsten Carstensen, Ngoc Tien Tran

Πηγή: ArXiv e-prints

Θεματικοί όροι: Complexity and performance of numerical algorithms, a posteriori, error estimates, a priori, linear elasticity, FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Stability and convergence of numerical methods for boundary value problems involving PDEs, Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, 65N12, 65N30, 65Y20, hybrid high-order

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.02768
https://zbmath.org/8029910
https://doi.org/10.1137/24m1650363

Numerical approaches for non-local transport-dominated PDE models with applications to biology

Συγγραφείς: Johan Marguet, Raluca Eftimie, Alexei Lozinski

Πηγή: Computational and Applied Mathematics. 44

Θεματικοί όροι: Complexity and performance of numerical algorithms, non-local models, Research exposition (monographs, survey articles) pertaining to numerical analysis, FOS: Mathematics, finite elements, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, Computational methods for problems pertaining to biology, Numerical methods for integral equations, integral transforms, biology and ecology, numerical approaches

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2505.00708

Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples: Optimal approximation of infinite-dimensional holomorphic functions. II: Recovery from i.i.d. pointwise samples

Συγγραφείς: Adcock, Ben, Dexter, Nick, Moraga, Sebastian

Πηγή: Journal of Complexity. 89:101933

Θεματικοί όροι: pointwise samples, Approximation by polynomials, Complexity and performance of numerical algorithms, 65D40, 41A10, 41A63, 65Y20, 41A25, Multidimensional problems, holomorphic functions, FOS: Mathematics, Numerical approximation of high-dimensional functions, sparse grids, information complexity, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), high-dimensional approximation

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2310.16940

Efficient Iterative Arbitrary High-Order Methods: an Adaptive Bridge Between Low and High Order: Efficient iterative arbitrary high-order methods: an adaptive bridge between low and high order

Συγγραφείς: Micalizzi L., Torlo D., Boscheri W.

Πηγή: Commun Appl Math Comput

Θεματικοί όροι: Deferred Correction (DeC), Arbitrary DERivative (ADER), Original Paper, arbitrary high order, arbitrary derivative (ADER), Numerical Analysis (math.NA), Arbitrary high order, 01 natural sciences, deferred correction (DeC), Complexity and performance of numerical algorithms, Hyperbolic conservation laws, FOS: Mathematics, \(p\)-adaptivity, positivity preserving, p-Adaptivity, Positivity preserving, p-adaptivity, Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs, Mathematics - Numerical Analysis, 0101 mathematics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.07783
https://zbmath.org/7996400
https://doi.org/10.1007/s42967-023-00290-w
https://hdl.handle.net/11573/1707525
https://doi.org/10.1007/s42967-023-00290-w
https://link.springer.com/article/10.1007/s42967-023-00290-w
https://doi.org/10.1007/s42967-023-00290-w
https://hdl.handle.net/11392/2544671
https://arxiv.org/abs/2212.07783
https://doi.org/10.1007/s42967-023-00290-w
https://hdl.handle.net/20.500.11767/136011

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization

Συγγραφείς: Frank E. Curtis, Michael J. O’Neill, Daniel P. Robinson

Πηγή: Mathematical Programming. 205:431-483

Θεματικοί όροι: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, stochastic optimization, nonlinear optimization, sequential quadratic optimization, worst-case complexity, 49M37, 65K05, 65K10, 90C15, 90C30, 90C55, Methods of successive quadratic programming type, Complexity and performance of numerical algorithms, Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Analysis of algorithms, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2112.14799
https://zbmath.org/7829609
https://doi.org/10.1007/s10107-023-01981-1

The Discrete Raviart-Thomas Mixed Finite Element Method for the $p$-Laplace Equation: The discrete Raviart-Thomas mixed finite element method for the \(p\)-Laplace equation

Συγγραφείς: Guo, M. M., Liu, D. J.

Πηγή: International Journal of Numerical Analysis and Modeling. 20:313-328

Θεματικοί όροι: Complexity and performance of numerical algorithms, adaptive finite element methods, Error bounds for boundary value problems involving PDEs, discrete Raviart-Thomas mixed finite element method, Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, Stability and convergence of numerical methods for boundary value problems involving PDEs, Quasilinear elliptic equations with \(p\)-Laplacian, \(p\)-Laplace equation

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7709142
https://doi.org/10.4208/ijnam2023-1012

SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic: Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic

Συγγραφείς: Steffen Börm, Sven Christophersen, Ronald Kriemann

Πηγή: SIAM Journal on Scientific Computing. 44:C77-C98

Θεματικοί όροι: hierarchical matrices, Complexity and performance of numerical algorithms, task graph, Numerical linear algebra, 0202 electrical engineering, electronic engineering, information engineering, parallel algorithms, Analysis of algorithms, many-core processors, Parallel numerical computation, 02 engineering and technology, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences

Περιγραφή αρχείου: application/xml

Hierarchical Orthogonal Factorization: Sparse Square Matrices: Hierarchical orthogonal factorization: sparse square matrices

Συγγραφείς: Abeynaya Gnanasekaran, Eric Darve

Πηγή: SIAM Journal on Matrix Analysis and Applications. 43:94-123

Θεματικοί όροι: Householder reflections, 65F08 (Primary), 65F25, 65F50, 65Y20, 65F05 (Secondary), Numerical Analysis (math.NA), G.1.3, low-rank, 01 natural sciences, Orthogonalization in numerical linear algebra, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, hierarchical factorization, sparse linear solver, FOS: Mathematics, Preconditioners for iterative methods, nested dissection, Mathematics - Numerical Analysis, 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2010.06807
http://arxiv.org/abs/2010.06807
https://zbmath.org/7471934
https://doi.org/10.1137/20m1373475

Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms

Συγγραφείς: L. D'Amore, V. Mele, D. Romano, G. Laccetti

Πηγή: Computing and informatics 38 (2019): 817–850. doi:10.31577/cai_2019_4_817
info:cnr-pdr/source/autori:D'Amore, Luisa; Mele, Valeria; Romano, Diego; Laccetti, Giuliano/titolo:Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms/doi:10.31577%2Fcai_2019_4_817/rivista:Computing and informatics/anno:2019/pagina_da:817/pagina_a:850/intervallo_pagine:817–850/volume:38
COMPUTING AND INFORMATICS; Vol. 38 No. 4 (2019): Computing and Informatics; 817–850

Θεματικοί όροι: parallel algorithms, 68R01, 02 engineering and technology, Complexity and performance of numerical algorithms, Performance Metrics, Data Decomposition, Concurrency, Parallel Algorithms, Data Decomposition, performance metrics, 65Y20, data decomposition, Complexity and performance of numerical algorithms, 65Y05, Concurrency, Parallel Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Performance Metrics, concurrency

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/11588/758900
https://cai.type.sk/content/2019/4/multilevel-algebraic-approach-for-performance-analysis-of-parallel-algorithms/
https://www.cai.sk/ojs/index.php/cai/article/view/2019_4_817
https://www.iris.unina.it/handle/11588/758900
http://www.cai.sk/ojs/index.php/cai/article/view/2019_4_817
https://dblp.uni-trier.de/db/journals/cai/cai38.html#DAmoreMRL19
http://www.cai.sk/ojs/index.php/cai/article/download/2019_4_817/974
https://hdl.handle.net/20.500.14243/385500
https://doi.org/10.31577/cai_2019_4_817
https://hdl.handle.net/11588/758900
https://doi.org/10.31577/cai_2019_4_817
https://cai.type.sk/content/2019/4/multilevel-algebraic-approach-for-performance-analysis-of-parallel-algorithms/

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations: An algebraic sparsified nested dissection algorithm using low-rank approximations

Συγγραφείς: Léopold Cambier, Chao Chen, Erik G. Boman, Sivasankaran Rajamanickam, Raymond S. Tuminaro, Eric Darve

Πηγή: SIAM Journal on Matrix Analysis and Applications. 41:715-746

Θεματικοί όροι: Iterative numerical methods for linear systems, preconditioner, Numerical Analysis (math.NA), low-rank, 01 natural sciences, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, hierarchical matrix, sparse linear solver, FOS: Mathematics, Preconditioners for iterative methods, nested dissection, Mathematics - Numerical Analysis, 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1901.02971
http://arxiv.org/abs/1901.02971
https://zbmath.org/7208133
https://doi.org/10.1137/19m123806x
https://epubs.siam.org/doi/10.1137/19M123806X
https://doi.org/10.1137/19M123806X
https://dblp.uni-trier.de/db/journals/siammax/siammax41.html#CambierCBRTD20

Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case: Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case

Συγγραφείς: Heinrich, Stefan

Πηγή: Journal of Complexity. 81:101821

Θεματικοί όροι: algorithm, Analysis of algorithms and problem complexity, adaptive, Parameterized complexity, tractability and kernelization, Communication complexity, information complexity, Numerical Analysis (math.NA), General theory of numerical analysis in abstract spaces, Complexity and performance of numerical algorithms, information-based complexity, Algorithms for approximation of functions, randomized, vector-valued mean, FOS: Mathematics, nonadaptive, Mathematics - Numerical Analysis

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.13471

Bridging the Gap Between Flat and Hierarchical Low-Rank Matrix Formats: The Multilevel Block Low-Rank Format: Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format

Συγγραφείς: Alfredo Buttari, Jean-Yves L'Excellent, Patrick R. Amestoy, Théo Mary

Πηγή: SIAM Journal on Scientific Computing. 41:A1414-A1442

Θεματικοί όροι: hierarchical matrices, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, low-rank approximations, Numerical methods for low-rank matrix approximation, matrix compression, sparse linear algebra, 0101 mathematics, matrix factorization, 01 natural sciences, Factorization of matrices

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://hal.archives-ouvertes.fr/hal-01774642/file/MBLR.pdf
http://eprints.maths.manchester.ac.uk/2694/
https://dblp.uni-trier.de/db/journals/siamsc/siamsc41.html#AmestoyBLM19
https://epubs.siam.org/doi/10.1137/18M1182760
https://hal.archives-ouvertes.fr/hal-01774642/document
https://hal.archives-ouvertes.fr/hal-01774642v3

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems: Hierarchical orthogonal factorization: sparse least squares problems

Συγγραφείς: Abeynaya Gnanasekaran, Eric Darve

Πηγή: Journal of Scientific Computing. 91

Θεματικοί όροι: Numerical solutions to overdetermined systems, pseudoinverses, sparse, 65F08 (Primary), 65F25, 65F50, 65Y20, 65F05 (Secondary), Numerical methods for low-rank matrix approximation, matrix compression, Numerical Analysis (math.NA), G.1.3, 01 natural sciences, Orthogonalization in numerical linear algebra, QR, Computational methods for sparse matrices, least squares, Complexity and performance of numerical algorithms, linear time, FOS: Mathematics, hierarchical solver, Mathematics - Numerical Analysis, 0101 mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2102.09878
https://zbmath.org/7544572
https://doi.org/10.1007/s10915-022-01824-9

Interconnected Hierarchical Structures for Fast Direct Elliptic Solution: Interconnected hierarchical structures for fast direct elliptic solution

Συγγραφείς: Liu, Xiao, Xia, Jianlin, de Hoop, Maarten V., Ou, Xiaofeng

Πηγή: Journal of Scientific Computing. 91

Θεματικοί όροι: Complexity and performance of numerical algorithms, neighbor tree, fast sparse direct solver, basis reuse, elliptic equation, Schur complement update, Numerical solution of discretized equations for boundary value problems involving PDEs, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, interconnected hierarchical structure, 01 natural sciences

Περιγραφή αρχείου: application/xml

Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures: Memory-efficient sparse matrix-matrix multiplication by row merging on many-core architectures

Συγγραφείς: Kerstin Küpper, Uwe Naumann, Felix Gremse

Πηγή: SIAM Journal on Scientific Computing. 40:C429-C449

Θεματικοί όροι: Computational methods for sparse matrices, Complexity and performance of numerical algorithms, sparse matrix-matrix multiplication, Numerical algorithms for specific classes of architectures, GPU-programming, algebraic multigrid, Galerkin product, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, fluorescence-mediated tomography

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/siamsc/siamsc40.html#GremseKN18
https://publications.rwth-aachen.de/record/745400
https://epubs.siam.org/doi/abs/10.1137/17M1121378
https://doi.org/10.1137/17M1121378

Extended Traub–Woźniakowski convergence and complexity of Newton iteration in Banach space: Extended Traub-Woźniakowski convergence and complexity of Newton iteration in Banach space

Συγγραφείς: Gilson N. Silva, Ioannis K. Argyros

Πηγή: Journal of Complexity. 43:38-50

Θεματικοί όροι: numerical example, Complexity and performance of numerical algorithms, Banach space, Iterative procedures involving nonlinear operators, Numerical solutions to equations with nonlinear operators, nonlinear operator equation, Newton iteration, local convergence, restricted convergence domain, 0101 mathematics, complexity, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.sciencedirect.com/science/article/pii/S0885064X17300651
https://www.sciencedirect.com/science/article/pii/S0885064X17300651
https://dblp.uni-trier.de/db/journals/jc/jc43.html#ArgyrosS17
https://doi.org/10.1016/j.jco.2017.06.001

Stabilized FEM for Some Optimal Design Problem: Stabilized FEM for some optimal design problem

Συγγραφείς: Q. Q. Xia, Dongjie Liu, Yang Liu, D. D. Jiang

Πηγή: Journal of Scientific Computing. 73:228-241

Θεματικοί όροι: a posteriori error estimates, Convex programming, convergence, degenerate convex minimization problem, Stability and convergence of numerical methods for boundary value problems involving PDEs, Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, 01 natural sciences, stabilization, Complexity and performance of numerical algorithms, adaptive finite element methods, Numerical mathematical programming methods, 0101 mathematics, numerical experiments, optimal design problem

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/article/10.1007/s10915-017-0409-8
https://link.springer.com/content/pdf/10.1007%2Fs10915-017-0409-8.pdf
https://dblp.uni-trier.de/db/journals/jscic/jscic73.html#LiuJLX17

On the Complexity of the Block Low-Rank Multifrontal Factorization: On the complexity of the block low-rank multifrontal factorization

Συγγραφείς: Amestoy, Patrick, Buttari, Alfredo, L'Excellent, Jean-Yves, Mary, Theo

Συνεισφορές: Mary, Theo, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse III - Paul Sabatier (UT3), ANR-11-IDEX-0002,UNITI,Université Fédérale de Toulouse(2011), ANR-11-LABX-0040,CIMI,Centre International de Mathématiques et d'Informatique (de Toulouse)(2011)

Πηγή: SIAM Journal on Scientific Computing. 39:A1710-A1740

Θεματικοί όροι: 65F05, Calcul parallèle, [MATH] Mathematics [math], [INFO] Computer Science [cs], Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, block low-rank, 15A23, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, Factorization of matrices, 65Y20, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, multifrontal factorization, distribué et partagé, [INFO]Computer Science [cs], 65F50, Multifrontal factorization, [MATH]Mathematics [math], 0101 mathematics, 65N30, sparse linear algebra, Sparse linear algebra, Calcul parallèle, distribué et partagé, Block low-rank, numerical result, Block Low-Rank AMS subject classifications 15A06, Block Low-Rank, complexity

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://hal.archives-ouvertes.fr/hal-01322230/file/SISC17.pdf
https://zbmath.org/6767761
https://doi.org/10.1137/16m1077192
https://hal.science/hal-01322230v3/document
https://hal.science/hal-01322230v3
https://doi.org/10.1137/16m1077192
http://dblp.uni-trier.de/db/journals/siamsc/siamsc39.html#AmestoyBLM17
https://hal-univ-tlse3.archives-ouvertes.fr/hal-01322230v1
https://doi.org/10.1137/16M1077192
https://locus.siam.org/doi/abs/10.1137/16M1077192
https://hal.archives-ouvertes.fr/hal-01322230v3
https://epubs.siam.org/doi/abs/10.1137/16M1077192
https://oatao.univ-toulouse.fr/19066/

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling: An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling

Συγγραφείς: Ghysels, Pieter, Li, Xiaoye S, Rouet, François-Henry, Williams, Samuel, Napov, Artem

Πηγή: SIAM journal on scientific computing, 38 (5
SIAM Journal on Scientific Computing, vol 38, iss 5
SIAM J. Sci. Comput., vol 38

Θεματικοί όροι: FOS: Computer and information sciences, Numerical and computational mathematics, Numerical & Computational Mathematics, HSS matrices, sparse Gaussian elimination, Direct numerical methods for linear systems and matrix inversion, randomized sampling algorithm, Multifrontal method, Sparse Gaussian elimination, 01 natural sciences, Mathematical Sciences, Analyse numérique, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, parallel algorithm, hierarchically semiseparable (HSS) matrices, 0101 mathematics, numerical experiments, 2. Zero hunger, multifrontal method, Numerical and Computational Mathematics, computational complexity, Applied Mathematics, Computation Theory and Mathematics, Parallel numerical computation, Applied mathematics, 16. Peace & justice, cs.MS, Parallel algorithm, interpolative decompositions, Computer Science - Mathematical Software, Mathematical Software (cs.MS), Programmation du calcul numérique

Περιγραφή αρχείου: application/xml; 2 full-text file(s): application/pdf; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1502.07405
http://arxiv.org/abs/1502.07405
https://zbmath.org/6645428
https://doi.org/10.1137/15m1010117
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/200878
https://escholarship.org/uc/item/9qf4r9m5
https://escholarship.org/content/qt1jx2p4xx/qt1jx2p4xx.pdf
https://escholarship.org/uc/item/1jx2p4xx