Publication

Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Publications related to Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II | EPFL Graph Search

Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II

Graph Chatbot

Chat with Graph Search

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

On Polynomial Algorithms for Normalizing Formulas

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Hybrid Flock - Formation Control Algorithms

The Role of Adaptivity in Source Identification with Time Queries

Minimum Cost Intervention Design for Causal Effect Identification

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

CovNet: Covariance networks for functional data on multidimensional domains