Listing 1 - 7 of 7 |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Mathematical analysis --- Functions --- Chebyshev approximation --- 517.5 --- 517.518.8 --- Analysis (Mathematics) --- Differential equations --- Mathematics --- Numbers, Complex --- Set theory --- Calculus --- Minimax approximation --- Tchebycheff approximation --- Approximation theory --- Theory of functions --- Approximation of functions by polynomials and their generalizations --- 517.518.8 Approximation of functions by polynomials and their generalizations --- 517.5 Theory of functions --- Analyse fonctionnelle --- Functional analysis --- Tchebychev, Approximation de --- Approximation, Théorie de l'
Choose an application
Many problems in science and engineering involve the solution of differential equations or systems. One of most successful methods of solving nonlinear equations is the determination of critical points of corresponding functionals. The study of critical points has grown rapidly in recent years and has led to new applications in other scientific disciplines. This monograph continues this theme and studies new results discovered since the author's preceding book entitled Linking Methods in Critical Point Theory. Written in a clear, sequential exposition, topics include semilinear problems, Fucik spectrum, multidimensional nonlinear wave equations, elliptic systems, and sandwich pairs, among others. With numerous examples and applications, this book explains the fundamental importance of minimax systems and describes how linking methods fit into the framework. Minimax Systems and Critical Point Theory is accessible to graduate students with some background in functional analysis, and the new material makes this book a useful reference for researchers and mathematicians. Review of the author's previous Birkhäuser work, Linking Methods in Critical Point Theory: The applications of the abstract theory are to the existence of (nontrivial) weak solutions of semilinear elliptic boundary value problems for partial differential equations, written in the form Au = f(x, u). . . . The author essentially shows how his methods can be applied whenever the nonlinearity has sublinear growth, and the associated functional may increase at a certain rate in every direction of the underlying space. This provides an elementary approach to such problems. . . . A clear overview of the contents of the book is presented in the first chapter, while bibliographical comments and variant results are described in the last one. MathSciNet
Differential equations --- differentiaalvergelijkingen --- Functional analysis --- Partial differential equations --- functies (wiskunde) --- Critical point theory (Mathematical analysis) --- Chebyshev approximation --- Maxima and minima --- Point critique, Théorie du (Analyse mathématique) --- Tchebychev, Approximation de --- Maxima et minima --- EPUB-LIV-FT LIVMATHE LIVSTATI SPRINGER-B
Choose an application
Numerical approximation theory --- 517.518.8 --- 519.6 --- 681.3*G12 --- Approximation of functions by polynomials and their generalizations --- Computational mathematics. Numerical analysis. Computer programming --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 517.518.8 Approximation of functions by polynomials and their generalizations --- Tchebychev, Approximation de --- Chebyshev approximation --- Approximation, Théorie de l'
Choose an application
Keine ausführliche Beschreibung für "Approximationstheorie" verfügbar.
Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 517.518.8 --- 519.6 --- 681.3*G12 --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- 517.518.8 Approximation of functions by polynomials and their generalizations --- Approximation of functions by polynomials and their generalizations --- Numerical approximation theory --- Approximation theory. --- Tchebychev, Approximation de --- Chebyshev approximation --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems
Listing 1 - 7 of 7 |
Sort by
|