default search action
Roland W. Freund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j22]Yuji Nakatsukasa
, Roland W. Freund:
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions. SIAM Rev. 58(3): 461-493 (2016)
2000 – 2009
- 2007
- [j21]Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch:
Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. Math. Program. 109(2-3): 581-611 (2007) - 2005
- [j20]Tin Kam Ho, Todd Salamon, Roland W. Freund, Christopher A. White, Bruce Hillyer, Lawrence C. Cowsar, Carl J. Nuzman, Daniel C. Kilper
Simulation of power evolution and control dynamics in optical transport systems. Bell Labs Tech. J. 10(1): 119-137 (2005) - 2004
- [j19]Roland W. Freund, Florian Jarre:
An extension of the positive real lemma to descriptor systems. Optim. Methods Softw. 19(1): 69-87 (2004) - [j18]Roland W. Freund, Florian Jarre:
A sensitivity result for semidefinite programs. Oper. Res. Lett. 32(2): 126-132 (2004) - [c10]Roland W. Freund:
SPRIM: structure-preserving reduced-order interconnect macromodeling. ICCAD 2004: 80-87 - 2001
- [j17]Roland W. Freund, Florian Jarre:
Solving the Sum-of-Ratios Problem by an Interior-Point Method. J. Glob. Optim. 19(1): 83-102 (2001) - [j16]Zhaojun Bai, Roland W. Freund:
A Symmetric Band Lanczos Process Based on Coupled Recurrences and Some Applications. SIAM J. Sci. Comput. 23(2): 542-562 (2001) - 2000
- [j15]José Ignacio Aliaga
A Lanczos-type method for multiple starting vectors. Math. Comput. 69(232): 1577-1601 (2000) - [j14]Zhaojun Bai, Roland W. Freund:
Eigenvalue-based characterization and test for positive realness of scalar transfer functions. IEEE Trans. Autom. Control. 45(12): 2396-2402 (2000) - [p2]Ming Gu, Axel Ruhe, Richard B. Lehoucq, Danny C. Sorensen, Roland W. Freund, Gerard L. G. Sleijpen, Henk A. van der Vorst, Zhaojun Bai, Ruipeng Li:
Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 45-107 - [p1]T. Chen, James Demmel, Ming Gu, Yousef Saad, Richard B. Lehoucq, Danny C. Sorensen, Kristyn J. Maschhoff, Zhaojun Bai, David Day, Roland W. Freund, Gerard L. G. Sleijpen, Henk A. van der Vorst, Ruipeng Li:
Non-Hermitian Eigenvalue Problems. Templates for the Solution of Algebraic Eigenvalue Problems 2000: 149-231
1990 – 1999
- 1999
- [j13]Roland W. Freund, Florian Jarre, Shinji Mizuno:
Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs. Math. Oper. Res. 24(1): 50-71 (1999) - [c9]Roland W. Freund:
Passive Reduced-Order Models for Interconnect Simulation and Their Computation via Krylov-Subspace Algorithms. DAC 1999: 195-200 - 1998
- [c8]Zhaojun Bai, Peter Feldmann, Roland W. Freund:
How to make theoretically passive reduced-order models passive in practice. CICC 1998: 207-210 - [c7]Roland W. Freund, Peter Feldmann:
Reduced-Order Modeling of Large Linear Passive Multi-Terminal Circuits Using Matrix-Pade Approximation. DATE 1998: 530-537 - 1997
- [c6]Peter Feldmann, Roland W. Freund:
Circuit noise evaluation by Padé approximation based model-reduction techniques. ICCAD 1997: 132-138 - 1996
- [j12]Roland W. Freund, Florian Jarre, Siegfried Schaible:
On self-concordant barrier functions for conic hulls and fractional programming. Math. Program. 74: 237-246 (1996) - [j11]Roland W. Freund, Florian Jarre:
A QMR-based interior-point algorithm for solving linear programs. Math. Program. 76: 183-210 (1996) - [j10]Roland W. Freund, Noël M. Nachtigal:
QMRPACK: A Package of QMR Algorithms. ACM Trans. Math. Softw. 22(1): 46-77 (1996) - [c5]Roland W. Freund, Peter Feldmann:
Reduced-order modeling of large passive linear circuits by means of the SYPVL algorithm. ICCAD 1996: 280-287 - 1995
- [j9]Peter Feldmann, Roland W. Freund:
Efficient linear circuit analysis by Pade approximation via the Lanczos process. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(5): 639-649 (1995) - [c4]Peter Feldmann, Roland W. Freund:
Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm. DAC 1995: 474-479 - [c3]Chuck Baldwin, Roland W. Freund, Efstratios Gallopoulos:
A Parallel Iterative Method for Exponential Propagation. PP 1995: 534-539 - 1994
- [j8]Roland W. Freund, Florian Jarre:
An interior-point method for fractional programs with convex constraints. Math. Program. 67: 407-440 (1994) - [j7]Roland W. Freund:
Editorial. Numer. Linear Algebra Appl. 1(4): 335 (1994) - [j6]Roland W. Freund, Marlis Hochbruck:
On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling. Numer. Linear Algebra Appl. 1(4): 403-420 (1994) - [j5]Roland W. Freund, Noël M. Nachtigal:
An Implementation of the QMR Method Based on Coupled Two-Term Recurrences. SIAM J. Sci. Comput. 15(2): 313-337 (1994) - [j4]Bernd Fischer, Roland W. Freund:
On Adaptive Weighted Polynomial Preconditioning for Hermitian Positive Definite Matrices. SIAM J. Sci. Comput. 15(2): 408-426 (1994) - [c2]Peter Feldmann, Roland W. Freund:
Efficient linear circuit analysis by Padé approximation via the Lanczos process. EURO-DAC 1994: 170-175 - [c1]Roland W. Freund, Peter Feldmann:
Efficient small-signal circuit analysis and sensitivity computations with the PVL algorithm. ICCAD 1994: 404-411 - 1993
- [j3]Roland W. Freund, Martin H. Gutknecht, Noël M. Nachtigal:
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices. SIAM J. Sci. Comput. 14(1): 137-158 (1993) - [j2]Roland W. Freund:
A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems. SIAM J. Sci. Comput. 14(2): 470-482 (1993) - 1992
- [j1]Roland W. Freund:
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices. SIAM J. Sci. Comput. 13(1): 425-448 (1992)
Coauthor Index
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-08-05 20:23 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: