scientific article; zbMATH DE number 3430031
From MaRDI portal
Publication:5180766
zbMath0273.65036MaRDI QIDQ5180766
M. J. D. Powell, A. R. Curtis, John K. Reid
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Numerical differentiation (65D25)
Related Items (79)
Domain decomposition methods for the parallel computation of reacting flows ⋮ A direct matrix method for computing analytical jacobians of discretized nonlinear integro-differential equations ⋮ Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization ⋮ Variance reduction with practical all-to-all lattice propagators ⋮ An estimator for the diagonal of a matrix ⋮ Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation ⋮ Matrix-free preconditioning using partial matrix estimation ⋮ An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM ⋮ Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization ⋮ The complexity of restricted star colouring ⋮ Recent developments in constrained optimization ⋮ A finite volume method for solute segregation in directional solidification and comparison with a finite element method ⋮ Preconditioned multigrid simulation of an axisymmetric laminar diffusion flame ⋮ Successive column correction algorithms for solving sparse nonlinear systems of equations ⋮ Improving the performance of a code for solving stiff systems of ODEs ⋮ On the convergence of partitioning group correction algorithms ⋮ CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems ⋮ A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization ⋮ Estimation of Sparse Jacobian Matrices ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ An efficient discontinuous Galerkin-mixed finite element model for variable density flow in fractured porous media ⋮ Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds ⋮ Numerical solution of the Hodgkin-Huxley equations in a moving coordinate system. Simulation of nerve impulse transmission over long distances ⋮ Direct Secant Updates of Matrix Factorizations ⋮ Inexact smoothing method for large scale minimax optimization ⋮ An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis ⋮ Approximate norm descent methods for constrained nonlinear systems ⋮ Newton-type methods for unconstrained and linearly constrained optimization ⋮ Domain decomposition techniques for the parallel solution of nonsymmetric systems of elliptic boundary value problems ⋮ Large-scale Sparse Inverse Covariance Matrix Estimation ⋮ Approximating Hessians in unconstrained optimization arising from discretized problems ⋮ Solution of burner-stabilized premixed laminar flames by boundary value methods ⋮ Graph models and their efficient implementation for sparse Jacobian matrix determination ⋮ Efficient corrector iteration for DAE time integration in multibody dynamics ⋮ Experiments with an ordinary differential equation solver in the parallel solution of method of lines problems on a shared-memory parallel computer ⋮ A comparison of optimization-based approaches for a model computational aerodynamics design problem ⋮ Graph coloring in the estimation of sparse derivative matrices: Instances and applications ⋮ The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models ⋮ On simulation and optimization of macroeconometric models ⋮ A computer model for one-dimensional mass and energy transport in and around chemically reacting particles, including complex gas-phase chemistry, multicomponent molecular diffusion, surface evaporation, and heterogeneous reaction ⋮ Optimization of unconstrained functions with sparse hessian matrices-newton-type methods ⋮ A probing method for computing the diagonal of a matrix inverse ⋮ Truncated-Newton algorithms for large-scale unconstrained optimization ⋮ Long-time integration methods for mesoscopic models of pattern-forming systems ⋮ Automatic implementation of material laws: Jacobian calculation in a finite element code with TAPENADE ⋮ Modelling variable density flow problems in heterogeneous porous media using the method of lines and advanced spatial discretization methods ⋮ Software for estimating sparse Jacobian matrices ⋮ Matrix factorizations in optimization of nonlinear functions subject to linear constraints ⋮ Efficient estimation of sparse Jacobian matrices by differences ⋮ Pattern graph for sparse Hessian matrix determination ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ The substitution secant/finite difference method for large scale sparse unconstrained optimization ⋮ Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications ⋮ Quasi-Newton acceleration for equality-constrained minimization ⋮ Multiple Set Point Partially Reduced SQP Method for Optimal Control of PDE ⋮ Optimization of Reactive Flows in a Single Channel of a Catalytic Monolith: Conversion of Ethane to Ethylene ⋮ Generating conjugate directions without line searches using factorized variable metric updating formulas ⋮ Schur complement domain decomposition algorithms for spectral methods ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices ⋮ Preconditioner updates for solving sequences of linear systems in matrix-free environment ⋮ Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications ⋮ The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices ⋮ Experiments in numerical methods for a problem in combustion modeling ⋮ Numerical methods for nonlinear equations ⋮ Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations ⋮ A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations ⋮ Design optimization for self-propulsion of a bulk carrier hull using a discrete adjoint method ⋮ Optimal approximation of sparse hessians and its equivalence to a graph coloring problem ⋮ A discrete Newton algorithm for minimizing a function of many variables ⋮ Local rectangular refinement with application to nonreacting and reacting fluid flow problems ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ A fully implicit, nonlinear adaptive grid strategy ⋮ Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms ⋮ Efficient detection of hessian matrix sparsity pattern ⋮ Estimation of sparse hessian matrices and graph coloring problems ⋮ Practical Direct Collocation Methods for Computational Optimal Control ⋮ Successive element correction algorithms for sparse unconstrained optimization ⋮ Linear conservation laws for ODEs ⋮ Two-dimensional fully adaptive solutions of solid-solid alloying reactions
This page was built for publication:
