We stand with Ukraine  

Aaron Melman

Orcid: 0000-0001-6761-665X

Affiliations:
  • Santa Clara University, USA


According to our database1, Aaron Melman authored at least 28 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An efficient approximation to the Cauchy radius.
[BibTeX]
[DOI]
Aaron Melman
Numer. Algorithms, May, 2024

2022
Polynomials Whose Zeros Are Powers of a Given Polynomial's Zeros.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2022

Root finding techniques that work.
[BibTeX]
[DOI]
Aaron Melman
CoRR, 2022

2021
Zero Exclusion Sectors for Some Polynomials with Structured Coefficients.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2021

An octagon containing the numerical range of a bounded linear operator.
[BibTeX]
[DOI]
Aaron Melman
CoRR, 2021

2018
Optimality of a Polynomial Multiplier.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2018

Eigenvalue bounds for matrix polynomials in generalized bases.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 2018

2016
On Pellet's Theorem for a class of lacunary polynomials.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 2016

2014
Implementation of Pellet's theorem.
[BibTeX]
[DOI]
Aaron Melman
Numer. Algorithms, 2014

2013
The Twin of a Theorem by Cauchy.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2013

2012
Modified Gershgorin Disks for Companion Matrices.
[BibTeX]
[DOI]
Aaron Melman
SIAM Rev., 2012

2009
Overshooting Properties of Newton-Like and Ostrowski-Like Methods.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2009

2008
Bounds on the Zeros of the Derivative of a Polynomial with All Real Zeros.
[BibTeX]
[DOI]
Aaron Melman
Am. Math. Mon., 2008

2007
The double-step Newton method for polynomials with all real zeros.
[BibTeX]
[DOI]
Aaron Melman
Appl. Math. Lett., 2007

2006
An Optimization Framework for Polynomial Zerofinders.
[BibTeX]
[DOI]
Aaron Melman
,
Bill Gragg
Am. Math. Mon., 2006

Computation of the Newton step for the even and odd characteristic polynomials of a symmetric positive definite Toeplitz matrix.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 2006

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

2001
The Even-Odd Split Levinson Algorithm for Toeplitz Systems.
[BibTeX]
[DOI]
Aaron Melman
SIAM J. Matrix Anal. Appl., 2001

Extreme eigenvalues of real symmetric Toeplitz matrices.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 2001

2000
A recurrence relation for singular real symmetric Toeplitz matrices.
[BibTeX]
[DOI]
Aaron Melman
IEEE Trans. Signal Process., 2000

An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems.
[BibTeX]
[DOI]
Aaron Melman
,
Gad Rabinowitz
SIAM Rev., 2000

Bounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices.
[BibTeX]
[DOI]
Aaron Melman
SIAM J. Matrix Anal. Appl., 2000

1998
Analysis of third-order methods for secular equations.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 1998

1997
Classroom Note: Geometry and Convergence of Euler's and Halley's Methods.
[BibTeX]
[DOI]
Aaron Melman
SIAM Rev., 1997

A unifying convergence analysis of second-order methods for secular equations.
[BibTeX]
[DOI]
Aaron Melman
Math. Comput., 1997

1996
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems.
[BibTeX]
[DOI]
Aaron Melman
SIAM J. Optim., 1996

The Newton modified barrier method for QP problems.
[BibTeX]
[DOI]
Aaron Melman
,
R. Polyak
Ann. Oper. Res., 1996

1994
A new linesearch method for quadratically constrained convex programming.
[BibTeX]
[DOI]
Aaron Melman
Oper. Res. Lett., 1994


  Loading...