activity
20062017
most citedAccurate eigenvalue decomposition of arrowhead matrices and applications

38 citations · 100 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2017★ 30 cited

A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables

Daniela di Serafino, Gerardo Toraldo, Marco Viola +1

We propose a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrai…

math.NA2014

Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices

Nevena Jakovcevic Stor, Ivan Slapnicar, Jesse L. Barlow

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenval…

math.NA2013★ 38 cited

Accurate eigenvalue decomposition of arrowhead matrices and applications

Nevena Jakovcevic Stor, Ivan Slapnicar, Jesse L. Barlow

We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding e…

math.NA2011

Reorthogonalized Block Classical Gram--Schmidt

Jesse L. Barlow, Alicja Smoktunowicz

A new reorthogonalized block classical Gram--Schmidt algorithm is proposed that factorizes a full column rank matrix into where is left orthogonal (has orthonormal c…

math.NA2006★ 32 cited

A note on the error analysis of classical Gram-Schmidt

Alicja Smoktunowicz, Jesse L. Barlow, Julien Langou

An error analysis result is given for classical Gram--Schmidt factorization of a full rank matrix into where is left orthogonal (has orthonormal columns) and is…