RESEARCHER PROFILE

Mario Arioli

← Back to LUM Jean Monnet University

M

LUM Jean Monnet University

Matrix Theory and AlgorithmsAdvanced Numerical Methods in Computational MathematicsAdvanced Optimization Algorithms ResearchIterative Methods for Nonlinear EquationsStatistical and numerical algorithms

Mario Arioli works in Matrix Theory and Algorithms, Advanced Numerical Methods in Computational Mathematics, Advanced Optimization Algorithms Research, Iterative Methods for Nonlinear Equations, Statistical and numerical algorithms. Recorded institutional associations include LUM Jean Monnet University.

103Publications
1,416Citations
22H-index

Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.

Selected research works

Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.

  1. Solving Sparse Linear Systems with Sparse Backward Error

    1989 · 184 citations
  2. On the augmented system approach to sparse least-squares problems

    1989 · 119 citations
  3. A stopping criterion for the conjugate gradient algorithm in a finite element method framework

    2004 · 74 citations
  4. Stopping Criteria for Iterative Solvers

    1992 · 65 citations
  5. Stopping criteria for iterations in finite element methods

    2004 · 62 citations
  6. Krylov sequences of maximal length and convergence of GMRES

    1998 · 58 citations
  7. A Block Projection Method for Sparse Matrices

    1992 · 57 citations
  8. Discrete Interpolation Norms with Applications

    2009 · 49 citations
  9. A finite element method for quantum graphs

    2017 · 49 citations
  10. Linear Algebra Methods in a Mixed Approximation of Magnetostatic Problems

    1999 · 45 citations
  11. The Padé method for computing the matrix exponential

    1996 · 43 citations
  12. Using FGMRES to obtain backward stability in mixed precision

    2008 · 42 citations
  13. Generalized Golub--Kahan Bidiagonalization and Stopping Criteria

    2013 · 40 citations
  14. Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic PDE problems

    2013 · 39 citations
  15. Stopping Criteria for Adaptive Finite Element Solvers

    2013 · 37 citations
  16. A Partial Condition Number for Linear Least Squares Problems

    2007 · 37 citations
  17. Block Lanczos Techniques for Accelerating the Block Cimmino Method

    1995 · 34 citations
  18. Chebyshev acceleration of iterative refinement

    2013 · 29 citations
  19. Iterative Solution of Symmetric Quasi-Definite Linear Systems

    2017 · 28 citations
  20. A Note on GMRES Preconditioned by a Perturbed $L D L^T$ Decomposition with Static Pivoting

    2007 · 27 citations
  21. Stopping criteria for iterative methods:¶applications to PDE's

    2001 · 26 citations
  22. The Use of QR Factorization in Sparse Quadratic Programming and Backward Error Issues

    2000 · 23 citations
  23. A null space algorithm for mixed finite‐element approximations of Darcy's equation

    2002 · 22 citations
  24. Discrete fractional Sobolev norms for domain decomposition preconditioning

    2012 · 20 citations
  25. A Backward Error Analysis of a Null Space Algorithm in Sparse Quadratic Programming

    2001 · 18 citations

← Return to the university profile