Roland W. Freund

Personal Home Page

http://www.math.ucdavis.edu/research/profiles/freund

Articles in Scholarly Journals [Incomplete List]

  1. On Padé-type model order reduction of J-Hermitian linear dynamical systems☆
    Linear Algebra and its Applications, 2008
  2. Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
    Mathematical Programming, vol. 109, no. 2-3, pp. 581–611, 2007
  3. Special issue on “Order reduction of large-scale systems”
    Linear Algebra and its Applications, vol. 415, no. 2-3, pp. 231–234, 2006
  4. Krylov Subspaces Associated with Higher-Order Linear Dynamical Systems
    BIT Numerical Mathematics, vol. 45, no. 3, pp. 495–516, 2005
  5. Simulation of power evolution and control dynamics in optical transport systems
    Bell Labs Technical Journal, vol. 10, no. 1, pp. 119–137, 2005
  6. A sensitivity result for semidefinite programs
    Operations Research Letters, vol. 32, no. 2, pp. 126–132, 2004
  7. An extension of the positive real lemma to descriptor systems
    Optimization Methods and Software, vol. 19, no. 1, pp. 69–87, 2004
  8. Model reduction methods based on Krylov subspaces
    Acta Numerica, vol. 12, pp. 267–319, 2003
  9. Journal of Global Optimization, vol. 19, no. 1, pp. 83–102, 2001
  10. A partial Padé-via-Lanczos method for reduced-order modeling
    Linear Algebra and its Applications, vol. 332-334, pp. 139–164, 2001
  11. Computation of matrix-valued formally orthogonal polynomials and applications
    Journal of Computational and Applied Mathematics, vol. 127, no. 1-2, pp. 173–199, 2001
  12. A Symmetric Band Lanczos Process Based on Coupled Recurrences and Some Applications
    SIAM Journal on Scientific Computing, vol. 23, no. 2, p. 542, 2001
  13. A Lanczos-type method for multiple starting vectors
    Mathematics of Computation, vol. 69, no. 232, pp. 1577–1602, 2000
  14. Krylov-subspace methods for reduced-order modeling in circuit simulation
    Journal of Computational and Applied Mathematics, vol. 123, no. 1-2, pp. 395–421, 2000
  15. A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
    Linear Algebra and its Applications, vol. 254, no. 1-3, pp. 119–157, 1997
  16. Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm
    Computer Methods in Applied Mechanics and Engineering, vol. 146, no. 1-2, pp. 173–196, 1997
  17. A QMR-based interior-point algorithm for solving linear programs
    Mathematical Programming, vol. 76, no. 1, pp. 183–210, 1997
  18. On self-concordant barrier functions for conic hulls and fractional programming
    Mathematical Programming, vol. 74, no. 3, pp. 237–246, 1996
  19. Small-signal circuit analysis and sensitivity computations with the PVL algorithm
    IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 43, no. 8, pp. 577–585, 1996
  20. QMRPACK: a package of QMR algorithms
    ACM Transactions on Mathematical Software, vol. 22, no. 1, pp. 46–77, 1996
  21. Efficient linear circuit analysis by Pade approximation via the Lanczos process
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 5, pp. 639–649, 1995
  22. An interior-point method for multifractional programs with convex constraints
    Journal of Optimization Theory and Applications, vol. 85, no. 1, pp. 125–161, 1995
  23. An interior-point method for fractional programs with convex constraints
    Mathematical Programming, vol. 67, no. 1-3, pp. 407–440, 1994
  24. A look-ahead algorithm for the solution of general Hankel systems
    Numerische Mathematik, vol. 64, no. 1, pp. 295–321, 1993
  25. A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications
    Linear Algebra and its Applications, vol. 184, pp. 165–186, 1993
  26. Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Teoplitz systems
    Linear Algebra and its Applications, vol. 188-189, pp. 255–303, 1993
  27. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
    Journal of Computational and Applied Mathematics, vol. 43, no. 1-2, pp. 135–158, 1992
  28. Chebyshev polynomials are not always optimal*1
    Journal of Approximation Theory, vol. 65, no. 3, pp. 261–272, 1991
  29. On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
    Linear Algebra and its Applications, vol. 154-156, no. 1, pp. 259–288, 1991
  30. QMR: a quasi-minimal residual method for non-Hermitian linear systems
    Numerische Mathematik, vol. 60, no. 1, pp. 315–339, 1991
  31. On conjugate gradient type methods and polynomial preconditioners for a class of complex non-hermitian matrices
    Numerische Mathematik, vol. 57, no. 1, pp. 285–312, 1990
  32. On the constrained Chebyshev approximation problem on ellipses
    Journal of Approximation Theory, vol. 62, no. 3, pp. 297–315, 1990
  33. On some approximation problems for complex polynomials
    Constructive Approximation, vol. 4, no. 1, pp. 111–121, 1988
  34. On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method
    Numerische Mathematik, vol. 48, no. 5, pp. 525–542, 1986