Aaron Melman

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 8

Top Topics

Linear Combination

Symmetric Matrix

Top Venues

Numer. Algorithms

Publications

Aaron Melman
An efficient approximation to the Cauchy radius. Numer. Algorithms 96 (1) (2024)
Aaron Melman
Polynomials Whose Zeros Are Powers of a Given Polynomial's Zeros. Am. Math. Mon. 129 (3) (2022)
Aaron Melman
Root finding techniques that work. CoRR (2022)
Aaron Melman
An octagon containing the numerical range of a bounded linear operator. CoRR (2021)
Aaron Melman
Zero Exclusion Sectors for Some Polynomials with Structured Coefficients. Am. Math. Mon. 128 (4) (2021)
Aaron Melman
Eigenvalue bounds for matrix polynomials in generalized bases. Math. Comput. 87 (312) (2018)
Aaron Melman
Optimality of a Polynomial Multiplier. Am. Math. Mon. 125 (2) (2018)
Aaron Melman
On Pellet's Theorem for a class of lacunary polynomials. Math. Comput. 85 (298) (2016)
Aaron Melman
Implementation of Pellet's theorem. Numer. Algorithms 65 (2) (2014)
Aaron Melman
The Twin of a Theorem by Cauchy. Am. Math. Mon. 120 (2) (2013)
Aaron Melman
Modified Gershgorin Disks for Companion Matrices. SIAM Rev. 54 (2) (2012)
Aaron Melman
Overshooting Properties of Newton-Like and Ostrowski-Like Methods. Am. Math. Mon. 116 (3) (2009)
Aaron Melman
Bounds on the Zeros of the Derivative of a Polynomial with All Real Zeros. Am. Math. Mon. 115 (2) (2008)
Aaron Melman
The double-step Newton method for polynomials with all real zeros. Appl. Math. Lett. 20 (6) (2007)
Aaron Melman
Computation of the Newton step for the even and odd characteristic polynomials of a symmetric positive definite Toeplitz matrix. Math. Comput. 75 (254) (2006)
Aaron Melman, Bill Gragg
An Optimization Framework for Polynomial Zerofinders. Am. Math. Mon. 113 (9) (2006)
Aaron Melman
Computation of the Smallest Even and Odd Eigenvalues of a Symmetric Positive-Definite Toeplitz Matrix. SIAM J. Matrix Anal. Appl. 25 (4) (2004)
Aaron Melman
Extreme eigenvalues of real symmetric Toeplitz matrices. Math. Comput. 70 (234) (2001)
Aaron Melman
The Even-Odd Split Levinson Algorithm for Toeplitz Systems. SIAM J. Matrix Anal. Appl. 23 (1) (2001)
Aaron Melman, Gad Rabinowitz
An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems. SIAM Rev. 42 (3) (2000)
Aaron Melman
Bounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices. SIAM J. Matrix Anal. Appl. 21 (2) (2000)
Aaron Melman
A recurrence relation for singular real symmetric Toeplitz matrices. IEEE Trans. Signal Process. 48 (6) (2000)
Aaron Melman
Analysis of third-order methods for secular equations. Math. Comput. 67 (221) (1998)
Aaron Melman
Classroom Note: Geometry and Convergence of Euler's and Halley's Methods. SIAM Rev. 39 (4) (1997)
Aaron Melman
A unifying convergence analysis of second-order methods for secular equations. Math. Comput. 66 (217) (1997)
Aaron Melman, R. Polyak
The Newton modified barrier method for QP problems. Ann. Oper. Res. 62 (1) (1996)
Aaron Melman
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems. SIAM J. Optim. 6 (2) (1996)
Aaron Melman
A new linesearch method for quadratically constrained convex programming. Oper. Res. Lett. 16 (2) (1994)