Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Sparse polynomial approximation of high-dimensional functions, Adcock, Ben Brugiapaglia, Simone Webster, Clayton G.


Варианты приобретения
Цена: 10534.00р.
Кол-во:
 о цене
Наличие: Отсутствует. 
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа


Добавить в корзину
в Мои желания

Автор: Adcock, Ben Brugiapaglia, Simone Webster, Clayton G.
Название:  Sparse polynomial approximation of high-dimensional functions
ISBN: 9781611976878
Издательство: Mare Nostrum (Eurospan)
Классификация:




ISBN-10: 1611976871
Обложка/Формат: Paperback
Страницы: 292
Вес: 0.64 кг.
Дата издания: 30.03.2022
Серия: Computational science and engineering
Язык: English
Размер: 181 x 259 x 25
Ключевые слова: Applied mathematics,Complex analysis, complex variables,Mathematical theory of computation,Numerical analysis,Probability & statistics
Рейтинг:
Поставляется из: Англии
Описание: Over seventy years ago, Richard Bellman coined the term the curse of dimensionality to describe phenomena and computational challenges that arise in high dimensions. These challenges, in tandem with the ubiquity of high-dimensional functions in real-world applications, have led to a lengthy, focused research effort on high-dimensional approximation—that is, the development of methods for approximating functions of many variables accurately and efficiently from data. This book provides an in-depth treatment of one of the latest installments in this long and ongoing story: sparse polynomial approximation methods. These methods have emerged as useful tools for various high-dimensional approximation tasks arising in a range of applications in computational science and engineering. It begins with a comprehensive overview of best s-term polynomial approximation theory for holomorphic, high-dimensional functions, as well as a detailed survey of applications to parametric differential equations. It then describes methods for computing sparse polynomial approximations, focusing on least squares and compressed sensing techniques.Sparse Polynomial Approximation of High-Dimensional Functions presents the first comprehensive and unified treatment of polynomial approximation techniques that can mitigate the curse of dimensionality in high-dimensional approximation, including least squares and compressed sensing. It develops main concepts in a mathematically rigorous manner, with full proofs given wherever possible, and it contains many numerical examples, each accompanied by downloadable code. The authors provide an extensive bibliography of over 350 relevant references, with an additional annotated bibliography available on the books companion website (www.sparse-hd-book.com).This text is aimed at graduate students, postdoctoral fellows, and researchers in mathematics, computer science, and engineering who are interested in high-dimensional polynomial approximation techniques.
Дополнительное описание: Numerical analysis|Applied mathematics|Mathematical theory of computation|Complex analysis, complex variables|Probability and statistics



Interpolation and Extrapolation Optimal Designs V1: Polynomial Regression and Approximation Theory

Автор: Giorgio Celant, Michel Broniatowski
Название: Interpolation and Extrapolation Optimal Designs V1: Polynomial Regression and Approximation Theory
ISBN: 1848219954 ISBN-13(EAN): 9781848219953
Издательство: Wiley
Рейтинг:
Цена: 22010.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

This book is the first of a series which focuses on the interpolation and extrapolation of optimal designs, an area with significant applications in engineering, physics, chemistry and most experimental fields.

In this volume, the authors emphasize the importance of problems associated with the construction of design. After a brief introduction on how the theory of optimal designs meets the theory of the uniform approximation of functions, the authors introduce the basic elements to design planning and link the statistical theory of optimal design and the theory of the uniform approximation of functions.

The appendices provide the reader with material to accompany the proofs discussed throughout the book.

Handbook on Semidefinite, Conic and Polynomial Optimization

Автор: Miguel F. Anjos; Jean B. Lasserre
Название: Handbook on Semidefinite, Conic and Polynomial Optimization
ISBN: 1489978038 ISBN-13(EAN): 9781489978035
Издательство: Springer
Рейтинг:
Цена: 33401.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.

Discrepancy of Signed Measures and Polynomial Approximation

Автор: Vladimir V. Andrievskii; Hans-Peter Blatt
Название: Discrepancy of Signed Measures and Polynomial Approximation
ISBN: 1441931465 ISBN-13(EAN): 9781441931467
Издательство: Springer
Рейтинг:
Цена: 25853.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A concise outline of the basic facts of potential theory and quasiconformal mappings makes this book an ideal introduction for non-experts who want to get an idea of applications of potential theory and geometric function theory in various fields of construction analysis.

Multivariate Polynomial Approximation

Автор: Manfred Reimer
Название: Multivariate Polynomial Approximation
ISBN: 3034894368 ISBN-13(EAN): 9783034894364
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book introduces general theory by presenting the most important facts on multivariate interpolation, quadrature, orthogonal projections and their summation, all treated under a constructive view, and embedded in the theory of positive linear operators.

Numerically Solving Polynomial Systems with Bertini

Автор: Bates
Название: Numerically Solving Polynomial Systems with Bertini
ISBN: 1611972698 ISBN-13(EAN): 9781611972696
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 15107.00 р.
Наличие на складе: Нет в наличии.

Описание: This book is a guide to concepts and practice in numerical algebraic geometry - the solution of systems of polynomial equations by numerical methods. Through numerous examples, the authors show how to apply the well-received and widely used open-source Bertini software package to compute solutions, including a detailed manual on syntax and usage options. The authors also maintain a complementary web page where readers can find supplementary materials and Bertini input files.Numerically Solving Polynomial Systems with Bertini approaches numerical algebraic geometry from a user's point of view with numerous examples of how Bertini is applicable to polynomial systems. It treats the fundamental task of solving a given polynomial system and describes the latest advances in the field, including algorithms for intersecting and projecting algebraic sets, methods for treating singular sets, the nascent field of real numerical algebraic geometry, and applications to large polynomial systems arising from differential equations.Those who wish to solve polynomial systems can start gently by finding isolated solutions to small systems, advance rapidly to using algorithms for finding positive-dimensional solution sets (curves, surfaces, etc.), and learn how to use parallel computers on large problems. These techniques are of interest to engineers and scientists in fields where polynomial equations arise, including robotics, control theory, economics, physics, numerical PDEs, and computational chemistry.

Constructive commutative algebra

Автор: Yengui, Ihsen
Название: Constructive commutative algebra
ISBN: 3319194933 ISBN-13(EAN): 9783319194936
Издательство: Springer
Рейтинг:
Цена: 6288.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

The main goal of this book is to find the constructive content hidden in abstract proofs of concrete theorems in Commutative Algebra, especially in well-known theorems concerning projective modules over polynomial rings (mainly the Quillen-Suslin theorem) and syzygies of multivariate polynomials with coefficients in a valuation ring.

Simple and constructive proofs of some results in the theory of projective modules over polynomial rings are also given, and light is cast upon recent progress on the Hermite ring and Gr bner ring conjectures. New conjectures on unimodular completion arising from our constructive approach to the unimodular completion problem are presented.

Constructive algebra can be understood as a first preprocessing step for computer algebra that leads to the discovery of general algorithms, even if they are sometimes not efficient. From a logical point of view, the dynamical evaluation gives a constructive substitute for two highly nonconstructive tools of abstract algebra: the Law of Excluded Middle and Zorn's Lemma. For instance, these tools are required in order to construct the complete prime factorization of an ideal in a Dedekind ring, whereas the dynamical method reveals the computational content of this construction. These lecture notes follow this dynamical philosophy.

Polynomial Chaos Methods for Hyperbolic Partial Differential Equations

Автор: Mass Per Pettersson; Gianluca Iaccarino; Jan Nords
Название: Polynomial Chaos Methods for Hyperbolic Partial Differential Equations
ISBN: 3319107135 ISBN-13(EAN): 9783319107134
Издательство: Springer
Рейтинг:
Цена: 15672.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Polynomial Chaos Methods for Hyperbolic Partial Differential Equations

Numerical Operations with Polynomial Matrices

Автор: Peter Stefanidis; Andrzej P. Paplinski; Michael J.
Название: Numerical Operations with Polynomial Matrices
ISBN: 3540549927 ISBN-13(EAN): 9783540549925
Издательство: Springer
Рейтинг:
Цена: 15672.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The purpose of this monograph is to describe a class of com-putational methods, based on polynomial matrices, for thedesign of dynamic compensators for linear multi-variablecontrol systems.

Homogeneous Polynomial Forms for Robustness Analysis of Uncertain Systems

Автор: Graziano Chesi; Andrea Garulli; Alberto Tesi; Anto
Название: Homogeneous Polynomial Forms for Robustness Analysis of Uncertain Systems
ISBN: 1848827806 ISBN-13(EAN): 9781848827806
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book presents a number of techniques for robustness analysis of uncertain systems. In it, convex relaxations for several robustness problems are derived by exploiting and providing new results on the theory of homogenous polynomial forms.

Error-Free Polynomial Matrix Computations

Автор: E.V. Krishnamurthy
Название: Error-Free Polynomial Matrix Computations
ISBN: 1461295726 ISBN-13(EAN): 9781461295723
Издательство: Springer
Рейтинг:
Цена: 16070.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book is written as an introduction to polynomial matrix computa- tions. This book is intended for seniors and graduate students in computer and system sciences, and mathematics, and for researchers in the fields of computer science, numerical analysis, systems theory, and computer algebra.

Elimination Methods in Polynomial Computer Algebra

Автор: V. Bykov; A. Kytmanov; M. Lazman; Mikael Passare
Название: Elimination Methods in Polynomial Computer Algebra
ISBN: 9401062307 ISBN-13(EAN): 9789401062305
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The subject of this book is connected with a new direction in mathematics, which has been actively developed over the last few years, namely the field of polynomial computer algebra, which lies at the intersection point of algebra, mathematical analysis and programming.

Parameterized Complexity in the Polynomial Hierarchy

Автор: Ronald de Haan
Название: Parameterized Complexity in the Polynomial Hierarchy
ISBN: 3662606690 ISBN-13(EAN): 9783662606698
Издательство: Springer
Рейтинг:
Цена: 10340.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия