default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAaron Melman
Person information
- affiliation: Santa Clara University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Aaron Melman:
An efficient approximation to the Cauchy radius. Numer. Algorithms 96(1): 1-11 (2024)- 2022
- [j25]Aaron Melman
:
Polynomials Whose Zeros Are Powers of a Given Polynomial's Zeros. Am. Math. Mon. 129(3): 276-280 (2022) - [i2]Aaron Melman:
Root finding techniques that work. CoRR abs/2204.02326 (2022) - 2021
- [j24]Aaron Melman:
Zero Exclusion Sectors for Some Polynomials with Structured Coefficients. Am. Math. Mon. 128(4): 322-336 (2021) - [i1]Aaron Melman:
An octagon containing the numerical range of a bounded linear operator. CoRR abs/2102.04572 (2021)
2010 – 2019
- 2018
- [j23]Aaron Melman:
Eigenvalue bounds for matrix polynomials in generalized bases. Math. Comput. 87(312): 1935-1948 (2018) - [j22]Aaron Melman:
Optimality of a Polynomial Multiplier. Am. Math. Mon. 125(2): 158-163 (2018) - 2016
- [j21]Aaron Melman:
On Pellet's Theorem for a class of lacunary polynomials. Math. Comput. 85(298): 707-716 (2016) - 2014
- [j20]Aaron Melman:
Implementation of Pellet's theorem. Numer. Algorithms 65(2): 293-304 (2014) - 2013
- [j19]Aaron Melman:
The Twin of a Theorem by Cauchy. Am. Math. Mon. 120(2): 164-168 (2013) - 2012
- [j18]Aaron Melman:
Modified Gershgorin Disks for Companion Matrices. SIAM Rev. 54(2): 355-373 (2012)
2000 – 2009
- 2009
- [j17]Aaron Melman:
Overshooting Properties of Newton-Like and Ostrowski-Like Methods. Am. Math. Mon. 116(3): 238-250 (2009) - 2008
- [j16]Aaron Melman:
Bounds on the Zeros of the Derivative of a Polynomial with All Real Zeros. Am. Math. Mon. 115(2): 145-147 (2008) - 2007
- [j15]Aaron Melman:
The double-step Newton method for polynomials with all real zeros. Appl. Math. Lett. 20(6): 671-675 (2007) - 2006
- [j14]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): 817-832 (2006) - [j13]Aaron Melman, Bill Gragg:
An Optimization Framework for Polynomial Zerofinders. Am. Math. Mon. 113(9): 794-804 (2006) - 2004
- [j12]Aaron Melman:
Computation of the Smallest Even and Odd Eigenvalues of a Symmetric Positive-Definite Toeplitz Matrix. SIAM J. Matrix Anal. Appl. 25(4): 947-963 (2004) - 2001
- [j11]Aaron Melman:
Extreme eigenvalues of real symmetric Toeplitz matrices. Math. Comput. 70(234): 649-669 (2001) - [j10]Aaron Melman:
The Even-Odd Split Levinson Algorithm for Toeplitz Systems. SIAM J. Matrix Anal. Appl. 23(1): 256-270 (2001) - 2000
- [j9]Aaron Melman:
Bounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices. SIAM J. Matrix Anal. Appl. 21(2): 362-378 (2000) - [j8]Aaron Melman, Gad Rabinowitz:
An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems. SIAM Rev. 42(3): 440-448 (2000) - [j7]Aaron Melman:
A recurrence relation for singular real symmetric Toeplitz matrices. IEEE Trans. Signal Process. 48(6): 1829-1831 (2000)
1990 – 1999
- 1998
- [j6]Aaron Melman:
Analysis of third-order methods for secular equations. Math. Comput. 67(221): 271-286 (1998) - 1997
- [j5]Aaron Melman:
A unifying convergence analysis of second-order methods for secular equations. Math. Comput. 66(217): 333-344 (1997) - [j4]Aaron Melman:
Classroom Note: Geometry and Convergence of Euler's and Halley's Methods. SIAM Rev. 39(4): 728-735 (1997) - 1996
- [j3]Aaron Melman, R. Polyak:
The Newton modified barrier method for QP problems. Ann. Oper. Res. 62(1): 465-519 (1996) - [j2]Aaron Melman:
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems. SIAM J. Optim. 6(2): 283-298 (1996) - 1994
- [j1]Aaron Melman:
A new linesearch method for quadratically constrained convex programming. Oper. Res. Lett. 16(2): 67-77 (1994)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
