ARPACK

ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems. The package is designed to compute a few eigenvalues and corresponding eigenvectors of a general n by n matrix A. It is most appropriate for large sparse or structured matrices A where structured means that a matrix-vector product w <- Av requires order n rather than the usual order n2 floating point operations. This software is based upon an algorithmic variant of the Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When the matrix A is symmetric it reduces to a variant of the Lanczos process called the Implicitly Restarted Lanczos Method (IRLM). These variants may be viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly Shifted QR technique that is suitable for large scale problems. For many standard problems, a matrix factorization is not required. Only the action of the matrix on a vector is needed. ARPACK software is capable of solving large scale symmetric, nonsymmetric, and generalized eigenproblems from significant application areas. The software is designed to compute a few (k) eigenvalues with user specified features such as those of largest real part or largest magnitude. Storage requirements are on the order of n*k locations. No auxiliary storage is required. A set of Schur basis vectors for the desired k-dimensional eigen-space is computed which is numerically orthogonal to working precision. Numerically accurate eigenvectors are available on request.


References in zbMATH (referenced in 674 articles , 1 standard article )

Showing results 1 to 20 of 674.
Sorted by year (citations)

1 2 3 ... 32 33 34 next

  1. Bergamaschi, Luca; Bozzo, Enrico: Computing the smallest eigenpairs of the graph Laplacian (2018)
  2. Birgin, E.G.; Haeser, G.; Ramos, Alberto: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
  3. Lenders, Felix; Kirches, C.; Potschka, A.: trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem (2018)
  4. Ma, Lingling; Jiang, Lijian: Convergence analysis for GMsFEM approximation of elliptic eigenvalue problems (2018)
  5. Adachi, Satoru; Iwata, Satoru; Nakatsukasa, Yuji; Takeda, Akiko: Solving the trust-region subproblem by a generalized eigenvalue problem (2017)
  6. Airiau, Christophe; Buchot, Jean-Marie; Dubey, Ritesh Kumar; Fournié, Michel; Raymond, Jean-Pierre; Weller-Calvo, Jessie: Stabilization and best actuator location for the Navier-Stokes equations (2017)
  7. Arndt, Daniel; Bangerth, Wolfgang; Davydov, Denis; Heister, Timo; Heltai, Luca; Kronbichler, Martin; Maier, Matthias; Pelteret, Jean-Paul; Turcksin, Bruno; Wells, David: The deal.II library, version 8.5 (2017)
  8. Benner, Peter; Dolgov, Sergey; Khoromskaia, Venera; Khoromskij, Boris N.: Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation (2017)
  9. Canton, J.; Auteri, F.; Carini, M.: Linear global stability of two incompressible coaxial jets (2017)
  10. Che, Maolin; Li, Guoyin; Qi, Liqun; Wei, Yimin: Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems (2017)
  11. Darnell, Gregory; Georgiev, Stoyan; Mukherjee, Sayan; Engelhardt, Barbara E.: Adaptive randomized dimension reduction on massive data (2017)
  12. Embree, Mark; Keeler, Blake: Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations (2017)
  13. Gomes, F.M.; Martínez, J.M.; Raydan, M.: On the computation of large-scale self-consistent-field iterations (2017)
  14. Guglielmi, Nicola; Lubich, Christian: Matrix stabilization using differential equations (2017)
  15. Guglielmi, Nicola; Lubich, Christian; Mehrmann, Volker: On the nearest singular matrix pencil (2017)
  16. Guglielmi, Nicola; Rehman, Mutti-Ur; Kressner, Daniel: A novel iterative method to approximate structured singular values (2017)
  17. Güttel, Stefan; Tisseur, Françoise: The nonlinear eigenvalue problem (2017)
  18. Haferssas, R.; Jolivet, P.; Nataf, F.: An additive Schwarz method type theory for Lions’s algorithm and a symmetrized optimized restricted additive Schwarz method (2017)
  19. Haferssas, Ryadh; Jolivet, Pierre; Nataf, Frédéric: An adaptive coarse space for P. L. Lions algorithm and optimized Schwarz methods (2017)
  20. Hall, Edward; Houston, Paul; Murphy, Steven: $hp$-adaptive discontinuous Galerkin methods for neutron transport criticality problems (2017)

1 2 3 ... 32 33 34 next