Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators
Journal Article
·
· Journal of Computational Physics
We present a robust and non-heuristic algorithm that finds all extremum points of the error distribution function of numerically Laplace-transformed orbital energy denominators. The extremum point search is one of the two key steps for finding the minimax approximation. If pre-tabulation of initial guesses is supposed to be avoided, strategies for a sufficiently robust algorithm have not been discussed so far. We compare our non-heuristic approach with a bracketing and bisection algorithm and demonstrate that 3 times less function evaluations are required altogether when applying it to typical non-relativistic and relativistic quantum chemical systems.
- OSTI ID:
- 22572356
- Journal Information:
- Journal of Computational Physics, Vol. 321; Other Information: Copyright (c) 2016 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA); ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Laplace-transformed denominators in perturbation theory: Linear-scaling second-order treatment of weakly interacting nanostructures
Projected Lagrangian algorithms for nonlinear minimax and l/sub 1/ optimization
A gradient feature weighted Minimax algorithm for registration of multiple portal images to 3DCT volumes in prostate radiotherapy
Journal Article
·
Mon Dec 01 00:00:00 EST 2003
· Physical Review. A
·
OSTI ID:22572356
Projected Lagrangian algorithms for nonlinear minimax and l/sub 1/ optimization
Technical Report
·
Wed Aug 01 00:00:00 EDT 1979
·
OSTI ID:22572356
A gradient feature weighted Minimax algorithm for registration of multiple portal images to 3DCT volumes in prostate radiotherapy
Journal Article
·
Thu Jun 01 00:00:00 EDT 2006
· International Journal of Radiation Oncology, Biology and Physics
·
OSTI ID:22572356
+4 more