A new linesearch method for quadratically constrained convex programming. - Aaron Melman (Oper. Res. Lett., 1994)

The Newton modified barrier method for QP problems. - Aaron Melman; R. Polyak (Ann. Oper. Res., 1996)

A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems. - Aaron Melman (SIAM J. Optim., 1996)

A unifying convergence analysis of second-order methods for secular equations. - Aaron Melman (Math. Comput., 1997)

Classroom Note: Geometry and Convergence of Euler's and Halley's Methods. - Aaron Melman (SIAM Rev., 1997)

Analysis of third-order methods for secular equations. - Aaron Melman (Math. Comput., 1998)

Bounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices. - Aaron Melman (SIAM J. Matrix Anal. Appl., 2000)

An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems. - Aaron Melman; Gad Rabinowitz (SIAM Rev., 2000)

A recurrence relation for singular real symmetric Toeplitz matrices. - Aaron Melman (IEEE Trans. Signal Process., 2000)

Extreme eigenvalues of real symmetric Toeplitz matrices. - Aaron Melman (Math. Comput., 2001)

The Even-Odd Split Levinson Algorithm for Toeplitz Systems. - Aaron Melman (SIAM J. Matrix Anal. Appl., 2001)

Computation of the Smallest Even and Odd Eigenvalues of a Symmetric Positive-Definite Toeplitz Matrix. - Aaron Melman (SIAM J. Matrix Anal. Appl., 2004)

Computation of the Newton step for the even and odd characteristic polynomials of a symmetric positive definite Toeplitz matrix. - Aaron Melman (Math. Comput., 2006)

An Optimization Framework for Polynomial Zerofinders. - Aaron Melman; Bill Gragg (Am. Math. Mon., 2006)

The double-step Newton method for polynomials with all real zeros. - Aaron Melman (Appl. Math. Lett., 2007)

Bounds on the Zeros of the Derivative of a Polynomial with All Real Zeros. - Aaron Melman (Am. Math. Mon., 2008)

Overshooting Properties of Newton-Like and Ostrowski-Like Methods. - Aaron Melman (Am. Math. Mon., 2009)

Modified Gershgorin Disks for Companion Matrices. - Aaron Melman (SIAM Rev., 2012)

The Twin of a Theorem by Cauchy. - Aaron Melman (Am. Math. Mon., 2013)

Implementation of Pellet's theorem. - Aaron Melman (Numer. Algorithms, 2014)

On Pellet's Theorem for a class of lacunary polynomials. - Aaron Melman (Math. Comput., 2016)

Eigenvalue bounds for matrix polynomials in generalized bases. - Aaron Melman (Math. Comput., 2018)

Optimality of a Polynomial Multiplier. - Aaron Melman (Am. Math. Mon., 2018)

An octagon containing the numerical range of a bounded linear operator. - Aaron Melman (CoRR, 2021)

Zero Exclusion Sectors for Some Polynomials with Structured Coefficients. - Aaron Melman (Am. Math. Mon., 2021)

Root finding techniques that work. - Aaron Melman (CoRR, 2022)

Polynomials Whose Zeros Are Powers of a Given Polynomial's Zeros. - Aaron Melman (Am. Math. Mon., 2022)

An efficient approximation to the Cauchy radius. - Aaron Melman (Numer. Algorithms, 2024)