Search Results - Complexity and performance of numerical algorithms

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

Authors: Younghyun Cho James Demmel Michał Dereziński et al.

Source: SIAM Journal on Matrix Analysis and Applications, vol 46, iss 2

Subject Terms: 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

File Description: application/xml; application/pdf

Access URL: 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

Authors: Carsten Carstensen Ngoc Tien Tran

Source: ArXiv e-prints

Subject Terms: 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

File Description: application/xml

Access URL: 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

Authors: Johan Marguet Raluca Eftimie Alexei Lozinski

Source: Computational and Applied Mathematics. 44

Subject Terms: 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

File Description: application/xml

Access URL: http://arxiv.org/abs/2505.00708

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

Authors: Frank E. Curtis Michael J. O’Neill Daniel P. Robinson

Source: Mathematical Programming. 205:431-483

Subject Terms: 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

File Description: application/xml

Access URL: http://arxiv.org/abs/2112.14799
https://zbmath.org/7829609
https://doi.org/10.1007/s10107-023-01981-1

Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms

Authors: L. D'Amore V. Mele D. Romano et al.

Source: 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

Subject Terms: 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

File Description: application/pdf

Access URL: 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/

PERFORMANCE PREDICTION FOR PARALLEL NUMERICAL ALGORITHMS: Performance prediction for parallel numerical algorithms

Authors: Harry A. G. Wijshoff Kyle A. Gallivan Allen D. Malony et al.

Source: International Journal of High Speed Computing. :31-62

Subject Terms: Complexity and performance of numerical algorithms, Analysis of algorithms and problem complexity, Parallel numerical computation, parallel computation, numerical scientific computing, Alliant FX/8 multiprocessor, performance prediction, Lawrence Livermore Loops

File Description: application/xml

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

Authors: Adcock, Ben Dexter, Nick Moraga, Sebastian

Source: Journal of Complexity. 89:101933

Subject Terms: 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

File Description: application/xml

Access URL: http://arxiv.org/abs/2310.16940

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

Authors: Léopold Cambier Chao Chen Erik G. Boman et al.

Source: SIAM Journal on Matrix Analysis and Applications. 41:715-746

Subject Terms: 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

File Description: application/xml

Access URL: 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

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

Authors: Micalizzi L. Torlo D. Boscheri W.

Source: Commun Appl Math Comput

Subject Terms: 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

File Description: application/xml; application/pdf

Access URL: 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

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

Authors: Heinrich, Stefan

Source: Journal of Complexity. 81:101821

Subject Terms: 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

File Description: application/xml

Access URL: http://arxiv.org/abs/2306.13471

Algorithms for Numerical Analysis in High Dimensions: Algorithms for numerical analysis in high dimensions

Authors: Gregory Beylkin Martin J. Mohlenkamp Legrand, Mathias

Contributors: Gregory Beylkin Martin J. Mohlenkamp Legrand, Mathias

Source: SIAM Journal on Scientific Computing. 26:2133-2159

Subject Terms: antisymmetric functions, Iterative numerical methods for linear systems, computational complexity, separation of variables, alternating least squares, [MATH] Mathematics [math], General theory of numerical analysis in abstract spaces, curse of dimensionality, 01 natural sciences, Complexity and performance of numerical algorithms, separated representation, Algorithms for approximation of functions, Applications to the sciences, multidimensional function, multiparticle Schrödinger equation, Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics, algorithms in high dimensions, separated solutions of linear systems, [SPI.MECA.STRU] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], 0101 mathematics, separation-rank reduction, multidimensional operator

File Description: application/pdf; application/xml

Access URL: https://hal.archives-ouvertes.fr/hal-02076682/file/Beylkin2005.pdf
https://hal.science/hal-02076682v1
https://hal.science/hal-02076682v1/document
https://doi.org/10.1137/040604959
https://zbmath.org/2207145
https://doi.org/10.1137/040604959
https://amath.colorado.edu/faculty/beylkin/papers/BEY-MOH-2005.pdf
https://dblp.uni-trier.de/db/journals/siamsc/siamsc26.html#BeylkinM05
https://locus.siam.org/doi/abs/10.1137/040604959
https://epubs.siam.org/doi/10.1137/040604959
https://core.ac.uk/display/20864080
http://amath.colorado.edu/faculty/beylkin/papers/BEY-MOH-2005.pdf

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

Authors: Guo, M. M. Liu, D. J.

Source: International Journal of Numerical Analysis and Modeling. 20:313-328

Subject Terms: 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

File Description: application/xml

Access URL: https://zbmath.org/7709142
https://doi.org/10.4208/ijnam2023-1012

Numerical performance of preconditioning techniques for the solution of complex sparse linear systems

Authors: MAZZIA, ANNAMARIA PINI, GIORGIO

Source: Communications in Numerical Methods in Engineering. 19:37-48

Subject Terms: Iterative numerical methods for linear systems, Numerical computation of matrix norms, conditioning, scaling, parallel algorithms, Parallel numerical computation, preconditioned iterative methods, sparse approximate inverse, 01 natural sciences, Computational methods for sparse matrices, Complexity and performance of numerical algorithms, Frobenius norm minimization, preconditioning, approximate inverses, complex sparse linear systems, preconditioned iterative methods, incomplete factorizations, approximate inverses, parallel algorithms, ILU decomposition, conjugate gradient-type methods, incomplete factorizations, 0101 mathematics, numerical experiments, complex sparse linear systems

File Description: application/xml

Access URL: https://zbmath.org/1872739
https://doi.org/10.1002/cnm.568
http://onlinelibrary.wiley.com/doi/10.1002/cnm.568/abstract
https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fcnm.568
https://hdl.handle.net/11577/2461521
https://doi.org/10.1002/cnm.568

An Algorithm with Polylog Parallel Complexity for Solving Parabolic Partial Differential Equations: An algorithm with polylog parallel complexity for solving parabolic partial differential equations

Authors: Graham Horton Stefan Vandewalle P. Worley

Source: SIAM Journal on Scientific Computing. 16:531-541

Subject Terms: Complexity and performance of numerical algorithms, Multigrid methods, domain decomposition for initial value and initial-boundary value problems involving PDEs, massively parallel computation, parallel complexity, Parallel numerical computation, Initial value problems for second-order parabolic equations, 0101 mathematics, multigrid waveform relaxation algorithm, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/769988
https://doi.org/10.1137/0916034

Polynomial approximation algorithms with performance guarantees: An introduction-by-example: Polynomial approximation algorithms with performance guarantees: an introduction-by-example

Authors: Demange, Marc Paschos, Vangelis ESSEC et al.

Contributors: Demange, Marc Paschos, Vangelis ESSEC et al.

Source: European Journal of Operational Research. 165:555-568

Subject Terms: Combinatorial optimization, Complexity theory, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences, Complexity and performance of numerical algorithms, Traveling salesman, Computing science, Recherche opérationnelle

File Description: application/xml

Access URL: https://zbmath.org/2159746
https://doi.org/10.1016/j.ejor.2004.03.021

Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing: Performance evaluation of a multithreaded fast Fourier transform algorithm for derivative pricing

Authors: Ruppa K. Thulasiram Parimala Thulasiraman

Source: The Journal of Supercomputing. 26:43-58

Subject Terms: options pricing, Complexity and performance of numerical algorithms, Numerical methods (including Monte Carlo methods), 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, algorithms, fast Fourier transform, Numerical methods for discrete and fast Fourier transforms, performance, multithreading

File Description: application/xml

Access URL: https://zbmath.org/2057632
https://doi.org/10.1023/a:1024464001273
https://link.springer.com/article/10.1023/A:1024464001273

singular integral transforms and fast numerical algorithms: Singular integral transforms and fast numerical algorithms

Authors: D. S. Mashat Prabir Daripa

Source: Numerical Algorithms. 18(2):133-157

Subject Terms: singular integral transforms, General theory of numerical methods in complex analysis (potential theory, etc.), Complexity and performance of numerical algorithms, computational complexity, fast algorithms, Integral transforms of special functions, fast Fourier transform, Numerical methods for integral transforms

File Description: application/xml

On the Complexity of Self-Validating Numerical Integration and Approximation of Functions with Singularities: On the complexity of self-validating numerical integration and approximation of functions with singularities

Authors: Knut Petras

Source: Journal of Complexity. 14:302-318

Subject Terms: Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, Analysis of algorithms and problem complexity, Applied Mathematics, Interval and finite arithmetic, self-correcting algorithm, interval arithmetic, Symbolic computation and algebraic computation, Numerical quadrature and cubature formulas, automatic differentiation, 01 natural sciences, functions with singularities, Complexity and performance of numerical algorithms, quadrature, 0101 mathematics, complexity

File Description: application/xml

Access URL: https://zbmath.org/1236202
https://doi.org/10.1006/jcom.1998.0478
https://core.ac.uk/display/82754114
https://dblp.uni-trier.de/db/journals/jc/jc14.html#Petras98
https://www.sciencedirect.com/science/article/pii/S0885064X98904782#!
https://www.sciencedirect.com/science/article/pii/S0885064X98904782

A fully portable high performance minimal storage hybrid format Cholesky algorithm

Authors: Fred G. Gustavson John Reid Jerzy Waśniewski et al.

Source: ACM Transactions on Mathematical Software. 31:201-227

Subject Terms: Complexity and performance of numerical algorithms, LAPACK, 0202 electrical engineering, electronic engineering, information engineering, Packaged methods for numerical algorithms, 02 engineering and technology, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, LINPACK, symmetric positive-definite dense systems, 01 natural sciences, Cholesky factorization

File Description: application/xml

Access URL: http://orbit.dtu.dk/ws/files/5875386/imm3173.pdf
https://orbit.dtu.dk/en/publications/a-fully-portable-high-performance-minimal-storage-hybrid-format-cholesky-algorithm(73b4f63e-6036-4fae-b44a-3bbadb1eba41).html
https://dblp.uni-trier.de/db/journals/toms/toms31.html#AndersenGGRW05
https://core.ac.uk/display/13755213
http://www.scd.stfc.ac.uk/SCD/resources/reports/aggrwRAL2004017.pdf
https://dl.acm.org/doi/10.1145/1067967.1067969

Some Issues in the Theory of Optimal Algorithms and Informational Complexity: Some issues in the theory of optimal algorithms and informational complexity

Authors: N. M. Popov

Source: Computational Mathematics and Modeling. 12:137-156

Subject Terms: scalar global optimization problem, Complexity and performance of numerical algorithms, Analysis of algorithms and problem complexity, 0101 mathematics, Lipschitzian multi-criterion problems, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), informational complexity

File Description: application/xml

Access URL: https://link.springer.com/content/pdf/10.1023/A:1012562132541.pdf
https://link.springer.com/article/10.1023/A:1012562132541