Skip to main content

Accelerating BST Methods for Model Reduction with Graphics Processors

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7203))

Abstract

Model order reduction of dynamical linear time-invariant system appears in many scientific and engineering applications. Numerically reliable SVD-based methods for this task require \(\mathcal{O}(n^3)\) floating-point arithmetic operations, with n being in the range 103 − 105 for many practical applications. In this paper we investigate the use of graphics processors (GPUs) to accelerate model reduction of large-scale linear systems via Balanced Stochastic Truncation, by off-loading the computationally intensive tasks to this device. Experiments on a hybrid platform consisting of state-of-the-art general-purpose multi-core processors and a GPU illustrate the potential of this approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoulas, A.: Approximation of Large-Scale Dynamical Systems. SIAM Publications, Philadelphia (2005)

    Book  MATH  Google Scholar 

  2. Benner, P., Quintana-Ortí, E.S., Quintana-Ortí, G.: Efficient numerical algorithms for balanced stochastic truncation. Internat. J. in Applied Mathematics and Computer Science 1(1), 15–21 (2005)

    Google Scholar 

  3. Freund, R.: Reduced-order modeling techniques based on Krylov subspaces and their use in circuit simulation. In: Datta, B. (ed.) Applied and Computational Control, Signals, and Circuits, vol. 1, ch. 9, pp. 435–498. Birkhäuser, Boston (1999)

    Chapter  Google Scholar 

  4. Volkov, V., Demmel, J.: LU, QR and Cholesky factorizations using vector capabilities of GPUs. EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2008-49 (May 2008), http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-49.html

  5. Bientinesi, P., Igual, F.D., Kressner, D., Quintana-Ortí, E.S.: Reduction to Condensed Forms for Symmetric Eigenvalue Problems on Multi-core Architectures. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009. LNCS, vol. 6067, pp. 387–395. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Barrachina, S., Castillo, M., Igual, F.D., Mayo, R., Quintana-Ortí, E.S., Quintana-Ortí, G.: Exploiting the capabilities of modern GPUs for dense matrix computations. Concurrency and Computation: Practice and Experience 21, 2457–2477 (2009)

    Article  Google Scholar 

  7. Ltaif, H., Tomov, S., Nath, R., Du, P., Dongarra, J.: A scalable high performance cholesky factorization for multicore with gpu accelerators. University of Tennessee, LAPACK Working Note 223 (2009)

    Google Scholar 

  8. Benner, P., Ezzatti, P., Quintana-Ortí, E.S., Remón, A.: Using Hybrid CPU-GPU Platforms to Accelerate the Computation of the Matrix Sign Function. In: Lin, H.-X., Alexander, M., Forsell, M., Knüpfer, A., Prodan, R., Sousa, L., Streit, A. (eds.) Euro-Par 2009. LNCS, vol. 6043, pp. 132–139. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Desai, U., Pal, D.: A transformation approach to stochastic model reduction. IEEE Trans. Automat. Control AC–29, 1097–1100 (1984)

    Article  MathSciNet  Google Scholar 

  10. Green, M.: Balanced stochastic realization. Linear Algebra Appl. 98, 211–247 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Varga, A., Fasol, K.H.: A new square–root balancing–free stochastic truncation model reduction algorithm. In: Prepr. 12th IFAC World Congress, Sydney, Australia, vol. 7, pp. 153–156 (1993)

    Google Scholar 

  12. Varga, A.: Task II.B.1 – selection of software for controller reduction. The Working Group on Software (WGS), SLICOT Working Note 1999–18 (December 1999), http://www.win.tue.nl/niconet/NIC2/reports.html

  13. Benner, P., Quintana-Ortí, E.S., Quintana-Ortí, G.: State-space truncation methods for parallel model reduction of large-scale systems. Parallel Comput. 29, 1701–1722 (2003)

    Article  MathSciNet  Google Scholar 

  14. Anderson, B.: An algebraic solution to the spectral factorization problem. IEEE Trans. Automat. Control AC-12, 410–414 (1967)

    Article  Google Scholar 

  15. Anderson, B.: A system theory criterion for positive real matrices. SIAM J. Cont. 5, 171–182 (1967)

    Article  MATH  Google Scholar 

  16. Benner, P., Quintana-Ortí, E.S., Quintana-Ortí, G.: Solving linear-quadratic optimal control problems on parallel computers. Optimization Methods Software 23(6), 879–909 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Roberts, J.: Linear model reduction and solution of the algebraic Riccati equation by use of the sign function. Internat. J. Control 32, 677–687 (1980); Reprint of Technical Report No. TR-13, CUED/B-Control, Cambridge University, Engineering Department (1971)

    Article  MathSciNet  MATH  Google Scholar 

  18. Golub, G., Van Loan, C.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  19. Benner, P., Byers, R., Quintana-Ortí, E.S., Quintana-Ortí, G.: Solving algebraic Riccati equations on parallel computers using Newton’s method with exact line search. Parallel Comput. 26(10), 1345–1368 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gerbessiotis, A.V.: Algorithmic and Practical Considerations for Dense Matrix Computations on the BSP Model, Oxford University Computing Laboratory, PRG-TR 32 (1997), http://web.njit.edu/~alexg/pubs/papers/PRG3297.ps

  21. Ezzatti, P., Quintana-Ortí, E.S., Remón, A.: Using graphics processors to accelerate the computation of the matrix inverse. The Journal of Supercomputing (2011), http://dx.doi.org/10.1007/s11227-011-0606-4 , doi:10.1007/s11227-011-0606-4

  22. Strazdins, P.: A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia, Tech. Rep. TR-CS-98-07 (1998)

    Google Scholar 

  23. Benner, P., Saak, J.: A semi-discretized heat transfer model for optimal cooling of steel profiles. In: Benner, P., Mehrmann, V., Sorensen, D. (eds.) Dimension Reduction of Large-Scale Systems. Lecture Notes in Computational Science and Engineering. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benner, P., Ezzatti, P., Quintana-Ortí, E.S., Remón, A. (2012). Accelerating BST Methods for Model Reduction with Graphics Processors. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31464-3_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31464-3_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31463-6

  • Online ISBN: 978-3-642-31464-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics