Numerical experiments with one-dimensional adaptive cubic algorithm
From MaRDI portal
Publication:1802495
Recommendations
- An adaptive numerical cubature algorithm for simplices
- An explicit, adaptive grid algorithm for one-dimensional initial value problems
- scientific article; zbMATH DE number 3988593
- Numerical experiments with algorithms for the ADI and Zolotarev coefficients
- scientific article; zbMATH DE number 4143324
- Adaptive procedures for numerical methods
- Numerical experiments with the one-dimensional non-linear simplex search
- scientific article; zbMATH DE number 58696
- scientific article; zbMATH DE number 4060640
- scientific article; zbMATH DE number 701230
Cited in
(11)- The cubic algorithm for global optimization with box and equality constraints and application to the optimal allocation of resources
- The resolution of close minima
- Application of global optimization and radial basis functions to numerical solutions of weakly singular Volterra integral equations
- The fast cubic algorithm
- The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant
- Synthetic realization approach to fuzzy global optimization via gamma algorithm
- Global optimization in problems with uncertainties: the gamma algorithm.
- Non-causal models in long term planning via set contractive optimal control methods
- Extremal problems on probability distributions
- Pseudorandom lattices for global optimization
- Optimization of implicitly defined functions.
This page was built for publication: Numerical experiments with one-dimensional adaptive cubic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802495)
