Jesse L. Barlow
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jesse L. Barlow has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Alicja Smoktunowicz
Faculty of Mathematics and Information Science Warsaw University of Technology Koszykowa 75 00-662 Warsaw Poland
4 shared publications - Hongyuan Zha
The Pennsylvania State University
2 shared publications - Ivan Slapnicar
Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, Rudjera Boškovića 32, 21000 Split, Croatia
2 shared publications - Nevena Jakovcevic Stor
Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, Rudjera Boškovića 32, 21000 Split, Croatia
2 shared publications - Daniela di Serafino
Department of Mathematics and Applications University of Naples Federico II Napoli Italy
1 shared publication - Gerardo Toraldo
University of Campania Luigi Vanvitelli
1 shared publication
Latest Publications
- Open Access
A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
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-constrained convex quadratic programming [J.J. Mor\'e and G. Toraldo, SIAM J. Optim. 1, 1991], our approach alternates between two phases until convergence: an identification phase, which performs gradient projection iterations until either a candidate active set is identified or no reasonable progress is made, and an unconstrained minimization phase, which reduces the objective function in a suitable space defined by the identification phase, by applying either the conjugate gradient method or a recently proposed spectral gradient method. However, the algorithm differs from GPCG not only because it deals with a more general class of problems, but mainly for the way it stops the minimization phase. This is based on a comparison between a measure of optimality in the reduced space and a measure of bindingness of the variables that are on the bounds, defined by extending the concept of proportioning, which was proposed by some authors for box-constrained problems. If the objective function is bounded, the algorithm converges to a stationary point thanks to a suitable application of the gradient projection method in the identification phase. For strictly convex problems, the algorithm converges to the optimal solution in a finite number of steps even in case of degeneracy. Extensive numerical experiments show the effectiveness of the proposed approach.
Open AccessA two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
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-constrained convex quadratic programming [J.J. Mor\'e and G. Toraldo, SIAM J. Optim. 1, 1991], our approach alternates between two phases until convergence: an identification phase, which performs gradient projection iterations until either a candidate active set is identified or no reasonable progress is made, and an unconstrained minimization phase, which reduces the objective function in a suitable space defined by the identification phase, by applying either the conjugate gradient method or a recently proposed spectral gradient method. However, the algorithm differs from GPCG not only because it deals with a more general class of problems, but mainly for the way it stops the minimization phase. This is based on a comparison between a measure of optimality in the reduced space and a measure of bindingness of the variables that are on the bounds, defined by extending the concept of proportioning, which was proposed by some authors for box-constrained problems. If the objective function is bounded, the algorithm converges to a stationary point thanks to a suitable application of the gradient projection method in the identification phase. For strictly convex problems, the algorithm converges to the optimal solution in a finite number of steps even in case of degeneracy. Extensive numerical experiments show the effectiveness of the proposed approach.
- Open Access
Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
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 eigenvalue and all components of the corresponding eigenvector with high relative accuracy in $O(n)$ operations. The algorithm is based on a shift-and-invert approach. Only a single element of the inverse of the shifted matrix eventually needs to be computed with double the working precision. Each eigenvalue and the corresponding eigenvector can be computed separately, which makes the algorithm adaptable for parallel computing. Our results extend to the complex Hermitian case. The algorithm is similar to the algorithm for solving the eigenvalue problem for real symmetric arrowhead matrices from: N. Jakov\v{c}evi\'{c}~Stor, I. Slapni\v{c}ar and J. L. Barlow, {Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications}, Lin. Alg. Appl., 464 (2015).Open AccessForward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
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 eigenvalue and all components of the corresponding eigenvector with high relative accuracy in $O(n)$ operations. The algorithm is based on a shift-and-invert approach. Only a single element of the inverse of the shifted matrix eventually needs to be computed with double the working precision. Each eigenvalue and the corresponding eigenvector can be computed separately, which makes the algorithm adaptable for parallel computing. Our results extend to the complex Hermitian case. The algorithm is similar to the algorithm for solving the eigenvalue problem for real symmetric arrowhead matrices from: N. Jakov\v{c}evi\'{c}~Stor, I. Slapni\v{c}ar and J. L. Barlow, {Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications}, Lin. Alg. Appl., 464 (2015). - Open Access
Accurate eigenvalue decomposition of arrowhead matrices and applications
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 eigenvectors with high relative accuracy in $O(n^{2})$ operations. The algorithm is based on a shift-and-invert approach. Double precision is eventually needed to compute only one element of the inverse of the shifted matrix. Each eigenvalue and the corresponding eigenvector can be computed separately, which makes the algorithm adaptable for parallel computing. Our results extend to Hermitian arrowhead matrices, real symmetric diagonal-plus-rank-one matrices and singular value decomposition of real triangular arrowhead matrices.Open AccessAccurate eigenvalue decomposition of arrowhead matrices and applications
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 eigenvectors with high relative accuracy in $O(n^{2})$ operations. The algorithm is based on a shift-and-invert approach. Double precision is eventually needed to compute only one element of the inverse of the shifted matrix. Each eigenvalue and the corresponding eigenvector can be computed separately, which makes the algorithm adaptable for parallel computing. Our results extend to Hermitian arrowhead matrices, real symmetric diagonal-plus-rank-one matrices and singular value decomposition of real triangular arrowhead matrices. - 7 March 2013
- Published by Springer Nature in Numerische Mathematik
- Vol. 124 (2) , 237-278
Reorthogonalization for the Golub–Kahan–Lanczos bidiagonal reduction
- 7 March 2013
- Published by Springer Nature in Numerische Mathematik
- Vol. 124 (2) , 237-278
Reorthogonalization for the Golub–Kahan–Lanczos bidiagonal reduction
- 12 September 2012
- Published by Springer Nature in Numerische Mathematik
- Vol. 123 (3) , 395-423
Reorthogonalized block classical Gram–Schmidt
- 12 September 2012
- Published by Springer Nature in Numerische Mathematik
- Vol. 123 (3) , 395-423
Reorthogonalized block classical Gram–Schmidt
- Open Access
A note on the error analysis of classical Gram-Schmidt
An error analysis result is given for classical Gram--Schmidt factorization of a full rank matrix $A$ into $A=QR$ where $Q$ is left orthogonal (has orthonormal columns) and $R$ is upper triangular. The work presented here shows that the computed $R$ satisfies $\normal{R}=\normal{A}+E$ where $E$ is an appropriately small backward error, but only if the diagonals of $R$ are computed in a manner similar to Cholesky factorization of the normal equations matrix. A similar result is stated in [Giraud at al, Numer. Math. 101(1):87--100,2005]. However, for that result to hold, the diagonals of $R$ must be computed in the manner recommended in this work.Open AccessA note on the error analysis of classical Gram-Schmidt
An error analysis result is given for classical Gram--Schmidt factorization of a full rank matrix $A$ into $A=QR$ where $Q$ is left orthogonal (has orthonormal columns) and $R$ is upper triangular. The work presented here shows that the computed $R$ satisfies $\normal{R}=\normal{A}+E$ where $E$ is an appropriately small backward error, but only if the diagonals of $R$ are computed in a manner similar to Cholesky factorization of the normal equations matrix. A similar result is stated in [Giraud at al, Numer. Math. 101(1):87--100,2005]. However, for that result to hold, the diagonals of $R$ must be computed in the manner recommended in this work. - 3 November 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 105 (2) , 299-313
A note on the error analysis of classical Gram–Schmidt
- 3 November 2006
- Published by Springer Nature in Numerische Mathematik
- Vol. 105 (2) , 299-313
A note on the error analysis of classical Gram–Schmidt
- 1 June 2005
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 45 (2) , 259-285
Improved Gram–Schmidt Type Downdating Methods
- 1 June 2005
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 45 (2) , 259-285
Improved Gram–Schmidt Type Downdating Methods
- 1 February 2005
- Published by Science Publications in Journal of Mathematics and Statistics
- Vol. 1 (2) , 124-128
Computing ULV Decomposition by Divide Conquer Method
Computing ULV Decomposition by Divide Conquer Method
- 1 February 2005
- Published by Science Publications in Journal of Mathematics and Statistics
- Vol. 1 (2) , 124-128
Computing ULV Decomposition by Divide Conquer Method
Computing ULV Decomposition by Divide Conquer Method
- 27 August 2004
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 50 (1) , 1-4
2nd Special issue on matrix computations and statistics
- 27 August 2004
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 50 (1) , 1-4
2nd Special issue on matrix computations and statistics