Del 909 i serien Lecture Notes in Mathematics

Numerical Analysis

Proceedings of the Third IIMAS Workshop Held at Cocoyoc, Mexico, January 1981

Häftad, Engelska, 1982

AvJ.P. Hennart

499 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1982-02-01
Mått155 x 235 x 15 mm
Vikt400 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Mathematics
Antal sidor254
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540111931

Tillhör följande kategorier

Beräkning och matematisk analys inom Naturvetenskap och teknik

Merit functions for nonlinear programming problems.- Global convergence of Newton-Like methods.- Topics in global optimization.- The tunnelling method for solving the constrained global optimization problem with several non-connected feasible regions.- An approach to nonlinear l 1 data fitting.- Towards a unified approach to data smoothing.- Generalizing the LINPACK condition estimator.- Demonstration of a matrix Laboratory.- A fast algorithm for the Euclidean distance location problem.- Discrete pressure equations in incompressible flow problems.- Standing waves in diffusive reacting systems.- A study of the stability of the interface between two inmiscible viscous fluids.- Solving Large nonlinear systems of equations arising in mechanics.- Smooth monotone spline interpolation.- Some hybrid implicit stiffly stable methods for ordinary differential equations.- Developing effective multistep methods for the numerical solution of systems of second order initial value problems.- Numerical solution of singular two-point boundary-value problems by invariant imbedding.- Difficulties in evaluating differential equation software.- Topics in finite element discretization of parabolic evolution problems.- A class of exponentially fitted piecewise continuous methods for initial value problems.- Recursive quadratic programming algorithms and their convergence properties.- Dual and primal-dual methods for solving strictly convex quadratic programs.- The design and use of a frontal scheme for solving sparse unsymmetric equations.