Page 1
Page 1
Multilevel Block Factorization Preconditioners : Matrix-based Analysis and Algorithms for Solving Finite Element Equations
This monograph is the first to provide a comprehensive, self-contained and rigorous presentation of some of the most powerful preconditioning methods for solving finite element equations in a common block-matrix factorization framework. Topics covered include the classical incomplete block-factorization preconditioners and the most efficient methods such as the multigrid, algebraic multigrid, and domain decomposition. Additionally, the author discusses preconditioning of saddle-point, nonsymmetric and indefinite problems, as well as preconditioning of certain nonlinear and quadratic constrained minimization problems that typically arise in contact mechanics. The book presents analytical as well as algorithmic aspects.
Matrix Algebra : Theory, Computations, and Applications in Statistics
Matrix algebra is one of the most important areas of mathematics for data analysis and for statistical theory. The first part of this book presents the relevant aspects of the theory of matrix algebra for applications in statistics. This part begins with the fundamental concepts of vectors and vector spaces, next covers the basic algebraic properties of matrices, then describes the analytic properties of vectors and matrices in the multivariate calculus, and finally discusses operations on matrices in solutions of linear systems and in eigenanalysis. This part is essentially self-contained.
Isomorphisms Between H¹ Spaces
Presents a thorough and self-contained presentation of H¹ and its known isomorphic invariants, such as the uniform approximation property, the dimension conjecture, and dichotomies for the complemented subspaces. The necessary background is developed from scratch. This includes a detailed discussion of the Haar system, together with the operators that can be built from it (averaging projections, rearrangement operators, paraproducts, Calderon-Zygmund singular integrals). Complete proofs are given for the classical martingale inequalities of C. Fefferman, Burkholder, and Khinchine-Kahane, and for large deviation inequalities. Complex interpolation, analytic families of operators, and the Calderon product of Banach lattices are treated in the context of H^p spaces. Througout the book, special attention is given to the combinatorial methods developed in the field, particularly J. Bourgain's proof of the dimension conjecture, L. Carleson's biorthogonal system in H¹, T. Figiel's integral representation, W.B. Johnson's factorization of operators, B. Maurey's isomorphism, and P. Jones' proof of the uniform approximation property. An entire chapter is devoted to the study of combinatorics of colored dyadic intervals."
Irreversible Decisions under Uncertainty : Optimal Stopping Made Easy
In real life, as well as in economic models, individuals often make decisions in an uncertain environment. In many cases, a problem which an optimizing agent faces can be formulated or reformulated as a problem of optimal timing of a certain irreversible or partially reversible action or optimal stopping problem. In this book, the authors present an alternative approach to optimal stopping problems. The basic ideas and techniques of the approach can be explained much simpler than the standard methods in the literature on optimal stopping problems. The monograph will teach the reader to apply the technique to many problems in economics and finance, including new ones. From the technical point of view, the method can be characterized as option pricing via the Wiener-Hopf factorization.
Interpolation, Schur Functions and Moment Problems
In signal processing, they are often named reflection coefficients. Under the word "Schur analysis" one encounters a variety of problems related to Schur functions, such as interpolation problems, moment problems, the study of the relationships between the Schur coefficients and the properties of the function, or the study of underlying operators. Such questions are also considered for some generalizations of Schur functions. Furthermore, there is an extension of the notion of a Schur function for functions that are analytic and have a positive real part in the open upper half-plane; these functions are called Carathéodory functions. This volume is almost entirely dedicated to the analysis of Schur and Carathéodory functions and to the solutions of problems for these classes.
Functions of a-Bounded Type in the Half-Plane
This is a unique book related to the theory of functions of a-bounded type in the half-plane of the complex plane, which is constructed by application of the Liouville integro-differential operator. In addition, the book contains improvements of several results such as the Phragmen-Lindelof Principle and Nevanlinna Factorization in the Half-Plane, and offers a new, equivalent definition of the classical Hardy spaces in the half-plane. The last chapter of the book presents an application of the constructed theory as well as M.M.Djrbashian’s theory of Nevanlinna type classes in the disc in the spectral theory of linear operators. This is a solution of a problem repeatedly stated by M.G.Krein and being of special interest for a long time.
Factorization of Matrix and Operator Functions : The State Space Method
The present book deals with factorization problems for matrix and operator functions. The problems originate from, or are motivated by, the theory of non-selfadjoint operators, the theory of matrix polynomials, mathematical systems and control theory, the theory of Riccati equations, inversion of convolution operators, theory of job scheduling in operations research. The book systematically employs a geometric principle of factorization which has its origins in the state space theory of linear input-output systems and in the theory of characteristic operator functions. This principle allows one to deal with different factorizations from one point of view. Covered are canonical factorization, minimal and non-minimal factorizations, pseudo-canonical factorization, and various types of degree one factorization.
Factorization Method in Quantum Mechanics
Introduces the factorization method in quantum mechanics at an advanced level with an aim to put mathematical and physical concepts and techniques like the factorization method, Lie algebras, matrix elements and quantum control at the Reader’s disposal.
Exponentially Dichotomous Operators and Applications
In this monograph the natural evolution operators of autonomous first-order differential equations with exponential dichotomy on an arbitrary Banach space are studied in detail. Characterizations of these so-called exponentially dichotomous operators in terms of their resolvents and additive and multiplicative perturbation results are given. The general theory of the first three chapters is then followed by applications to Wiener-Hopf factorization and Riccati equations, transport equations, diffusion equations of indefinite Sturm-Liouville type, noncausal infinite-dimensional linear continuous-time systems, and functional differential equations of mixed type.
Essays in Constructive Mathematics
This book aims to promote constructive mathematics, not by defining it or formalizing it, but by practicing it, by basing all definitions and proofs on finite algorithms. The topics covered derive from classic works of nineteenth century mathematics---among them Galois' theory of algebraic equations, Gauss's theory of binary quadratic forms and Abel's theorem about integrals of rational differentials on algebraic curves. It is not surprising that the first two topics can be treated constructively---although the constructive treatments shed a surprising amount of light on them---but the last topic, involving integrals and differentials as it does, might seem to call for infinite processes. In this case too, however, finite algorithms suffice to define the genus of an algebraic curve, to prove that birationally equivalent curves have the same genus, and to prove the Riemann-Roch theorem. The main algorithm in this case is Newton's polygon, which is given a full treatment. Other topics covered include the fundamental theorem of algebra, the factorization of polynomials over an algebraic number field, and the spectral theorem for symmetric matrices.
Difference Equations : From Rabbits to Chaos
Difference equations are models of the world around us. From clocks to computers to chromosomes, processing discrete objects in discrete steps is a common theme. Difference equations arise naturally from such discrete descriptions and allow us to pose and answer such questions as: How much? How many? How long? Difference equations are a necessary part of the mathematical repertoire of all modern scientists and engineers.The book cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron—Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly.
Computer algebra in scientific computing ; 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings
This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Algebra in Scientific Computing, CASC 2020, held in Linz, Austria, in September 2020. The conference was held virtually due to the COVID-19 pandemic. The 34 full papers presented together with 2 invited talks were carefully reviewed and selected from 41 submissions. They deal with cutting-edge research in all major disciplines of computer algebra. The papers cover topics such as polynomial algebra, symbolic and symbolic-numerical computation, applications of symbolic computation for investigating and solving ordinary differential equations, applications of CAS in the investigation and solution of celestial mechanics problems, and in mechanics, physics, and robotics.
An Introduction to Number Theory
An Introduction to Number Theory provides an introduction to the main streams of number theory. Starting with the unique factorization property of the integers, the theme of factorization is revisited several times throughout the book to illustrate how the ideas handed down from Euclid continue to reverberate through the subject. In particular, the book shows how the Fundamental Theorem of Arithmetic, handed down from antiquity, informs much of the teaching of modern number theory. The result is that number theory will be understood, not as a collection of tricks and isolated results, but as a coherent and interconnected theory. A number of different approaches to number theory are presented, and the different streams in the book are brought together in a chapter that describes the class number formula for quadratic fields and the famous conjectures of Birch and Swinnerton-Dyer. The final chapter introduces some of the main ideas behind modern computational number theory and its applications in cryptography.
Advances in cryptology -- ASIACRYPT 2006 ; 12th International conference on the theory and application of cryptology and information security, Shanghai, China, December 3-7, 2006, Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, held in Shanghai, China, December 2006. The 30 revised full papers cover attacks on hash functions, stream ciphers, biometrics and ECC computation, id-based schemes, public-key schemes, RSA and factorization, construction of hash function, protocols, block ciphers, and signatures.
A Generalization of Bohr-Mollerup's Theorem for Higher Order Convex Functions
This book develops a far-reaching generalization of Bohr-Mollerup's theorem to higher order convex functions, along lines initiated by Wolfgang Krull, Roger Webster, and some others but going considerably further than past work. In particular, this generalization shows using elementary techniques that a very rich spectrum of functions satisfy analogues of several classical properties of the gamma function, including Bohr-Mollerup's theorem itself, Euler's reflection formula, Gauss' multiplication theorem, Stirling's formula, and Weierstrass' canonical factorization.
