๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Optimization in solving elliptic problems

โœ Scribed by McCormick, Steve; D'yakonov, Eugene G


Publisher
CRC Press
Year
1996
Tongue
English
Leaves
591
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents


Content: Introduction. General Theory of Numerical Methods for Operator Equations. Projective-Grid Methods for Second-Order Elliptic Equations and Systems. Estimates of Computational Work in Solving Model Grid Systems. Construction of Topologically Equivalent Grids. Asymptotic Minimization of Computational Work in Solving Second-Order Elliptic Equations and Systems. Estimates of Computational Work of Optimal Type for Difference Methods. Minimization of Computational Work for Systems of Stokes and Navier-Stokes Types. Asymptotically Optimal Algorithms for Fourth-Order Elliptic Problems. Effective Algorithms for Spectral Problems. References. Index.

โœฆ Subjects


Differential equations, Elliptic.


๐Ÿ“œ SIMILAR VOLUMES


Optimization in Solving Elliptic Problem
โœ Eugene G. D'yakonov ๐Ÿ“‚ Library ๐Ÿ“… 2017 ๐Ÿ› CRC Press ๐ŸŒ English

<p><span>Optimization in Solving Elliptic Problems focuses on one of the most interesting and challenging problems of computational mathematics - the optimization of numerical algorithms for solving elliptic problems. It presents detailed discussions of how asymptotically optimal algorithms may be a

Solving Elliptic Problems Using ELLPACK
โœ John R. Rice, Ronald F. Boisvert (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Springer-Verlag New York ๐ŸŒ English

<p>ELLP ACK is a many faceted system for solving elliptic partial differential equations. It is a forerunner of the very high level, problem solving environments or expert systems that will become common in the next decade. While it is still far removed from the goals of the future, it is also far a

Consumer Optimization Problem Solving
โœ Alfred L. Norman ๐Ÿ“‚ Library ๐Ÿ“… 2015 ๐Ÿ› World Scientific ๐ŸŒ English

What algorithms are tractable depends on the speed of the processor. Given the speed of digital computers, polynomial algorithms are considered tractable. But, a human can take several seconds to make one binary comparison between two pens. Given this slow speed, sublinear algorithms are considered

Optimization in the Real World: Toward S
โœ Katsuki Fujisawa, Yuji Shinano, Hayato Waki (eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Springer Japan ๐ŸŒ English

<p>This book clearly shows the importance, usefulness, and powerfulness of current optimization technologies, in particular, mixed-integer programming and its remarkable applications. It is intended to be the definitive study of state-of-the-art optimization technologies for students, academic resea

Solving Optimization Problems with MATLA
โœ Dingyรผ Xue; Tsinghua University Press ๐Ÿ“‚ Library ๐Ÿ“… 2020 ๐Ÿ› De Gruyter ๐ŸŒ English

<p>This book focuses on solving optimization problems with MATLAB. Descriptions and solutions of nonlinear equations of any form are studied first. Focuses are made on the solutions of various types of optimization problems, including unconstrained and constrained optimizations, mixed integer, multi