Page 7
Page 7
Java Methods for Financial Engineering : Applications in Finance and Investment
This book is structured around the main theories and models used by practitioners to engineer finance and investment tools. The methods developed and implemented in the text are organized as chapters which cover the core areas.
Iterative Approximation of Fixed Points
The aim of this monograph is to give a unified introductory treatment of the most important iterative methods for constructing fixed points of nonlinear contractive type mappings. It summarizes the most significant contributions in the area by presenting, for each iterative method considered (Picard iteration, Krasnoselskij iteration, Mann iteration, Ishikawa iteration etc.), some of the most relevant, interesting, representative and actual convergence theorems. Applications to the solution of nonlinear operator equations as well as the appropriate error analysis of the main iterative methods, are also presented.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Complex Systems in Biomedicine
Features contributions from several Italian research groups that are working on the field of biomedicine. Each chapter in this book deals with a specific subfield, with the aim of providing an overview of the subject and an account of the research results.
Compatible Spatial Discretizations
Compatible spatial discretizations are those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. It offer a snapshot of the current trends and developments in compatible spatial discretizations. The reader will find valuable insights on spatial compatibility from several different perspectives and important examples of applications compatible discretizations in computational electromagnetics, geosciences, linear elasticity, eigenvalue approximations and MHD. The contributions collected in this volume will help to elucidate relations between different methods and concepts and to generally advance our understanding of compatible spatial discretizations for PDEs.
Cálculo científico con MATLAB y Octave = Scientific computing with MATLAB and Octave
This textbook is an introduction to Scientific Calculus, illustrating various numerical methods for the computer solution of certain classes of mathematical problems. The authors show how to compute the zeros or integrals of continuous functions, solve linear systems, approximate functions by polynomials, and construct precise approximations for the solution of differential equations. To make the presentation concrete and attractive, the MATLAB programming environment has been adopted as a faithful companion.
Cálculo científico com MATLAB e Octave = Scientific calculus with MATLAB and Octave
Its objective is to present various numerical methods for solving certain mathematical problems on the computer that cannot be treated in a simpler way. Classical issues such as the computation of zeros or integrals of continuous functions, the solving of linear systems, the approximation of functions by polynomials and the construction of precise approximations for solutions of differential equations are addressed. All algorithms are presented in the programming languages MATLAB and Octave, whose main commands and instructions are introduced gradually, aiming in particular at their compatibility in both languages.
Atomic spectroscopy : Introduction to the theory of hyperfine structure
Atomic Spectroscopy provides a comprehensive discussion on the general approach to the theory of atomic spectra, based on the use of the Lagrangian canonical formalism. This approach is developed and applied to explain the hydrogenic hyperfine structure associated with the nucleus motion, its finite mass, and spin. The non-relativistic or relativistic, spin or spin-free particle approximations can be used as a starting point of general approach. The special attention is paid to the theory of Lamb shift formation. The formulae for hydrogenic spectrum including the account of Lamb shift are written in simple analytical form. The book is of interest to specialists, graduate and postgraduate students, who are involved into the experimental and theoretical research in the field of modern atomic spectroscopy.
Asymptotic Analysis and Boundary Layers
Presents a new method of asymptotic analysis of boundary-layer problems, the Successive Complementary Expansion Method (SCEM). The first part is devoted to a general comprehensive presentation of the tools of asymptotic analysis. It gives the keys to understand a boundary-layer problem and explains the methods to construct an approximation. The second part is devoted to SCEM and its applications in fluid mechanics, including external and internal flows. The advantages of SCEM are discussed in comparison with the standard Method of Matched Asymptotic Expansions. In particular, for the first time, the theory of Interactive Boundary Layer is fully justified. With its chapter summaries, detailed derivations of results, discussed examples and fully worked out problems and solutions, the book is self-contained.
Artificial neural networks for the Modelling and Fault Diagnosis of Technical Processes
In this book, a wide spectrum of fault diagnosis techniques have been developed. A major category of fault diagnosis techniques is the model based one, where an analytical model of the plant to be monitored is assumed to be available.
Arithmetical investigations : Representation theory, orthogonal polynomials, and quantum interpolations
In this volume the author further develops his philosophy of quantum interpolation between the real numbers and the p-adic numbers. The p-adic numbers contain the p-adic integers Zp which are the inverse limit of the finite rings Z/pn. This gives rise to a tree, and probability measures w on Zp correspond to Markov chains on this tree. From the tree structure one obtains special basis for the Hilbert space L2(Zp,w). The real analogue of the p-adic integers is the interval [-1,1], and a probability measure w on it gives rise to a special basis for L2([-1,1],w) - the orthogonal polynomials, and to a Markov chain on "finite approximations" of [-1,1]. For special (gamma and beta) measures there is a "quantum" or "q-analogue" Markov chain, and a special basis, that within certain limits yield the real and the p-adic theories. This idea can be generalized variously. In representation theory, it is the quantum general linear group GLn(q)that interpolates between the p-adic group GLn(Zp), and between its real (and complex) analogue -the orthogonal On (and unitary Un )groups. There is a similar quantum interpolation between the real and p-adic Fourier transform and between the real and p-adic (local unramified part of) Tate thesis, and Weil explicit sums.
Approximation, randomization, and combinatorial optimization algorithms and techniques ; 9th International Workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 8th international workshop on approximation algorithms for compinatorial optimization problems, APPROX 2005 and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
This volume contains the papers presented at the 8th International Workshopon Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2005) and the 9th International Workshop on Randomization andComputation (RANDOM 2005), APPROX focuses on algorith-mic and complexity issues surrounding the development of efficient approximatesolutions to computationally hard problems, RANDOM isconcerned with applications of randomness to computational and combinatorialproblems, The volume contains 20 contributed papers selected by the APPROX Pro-gram
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the field. It focuses on algorithmic and complexity aspects ar- ing in the development of eficient approximate solutions to computationally dificult problems.
Approximation of Additive Convolution-Like Operators : Real C*-Algebra Approach
Various aspects of numerical analysis for equations arising in boundary integral equation methods have been the subject of several books published in the last 15 years [95, 102, 183, 196, 198]. Prominent examples include various classes of o- dimensional singular integral equations or equations related to single and double layer potentials. Usually, a mathematically rigorous foundation and error analysis for the approximate solution of such equations is by no means an easy task. One reason is the fact that boundary integral operators generally are neither integral operatorsof the formidentity plus compact operatornor identity plus an operator with a small norm. Consequently, existing standard theories for the numerical analysis of Fredholm integral equations of the second kind are not applicable. In the last 15 years it became clear that the Banach algebra technique is a powerful tool to analyze the stability problem for relevant approximation methods [102, 103, 183, 189]. The starting point for this approach is the observation that the ? stability problem is an invertibility problem in a certain BanachorC -algebra. As a rule, this algebra is very complicated – and one has to ?nd relevant subalgebras to use such tools as local principles and representation theory.
Approximation and Online Algorithms ; Vol.3879 : 3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers
The third Workshop on Approximation and Online Algorithms (WAOA 2005) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2005 took place in Palma de Mallorca, Spain, on 6–7 October 2005. The workshop was part of the ALGO 2005 event that also hosted ESA, WABI, and ATMOS. The two previous WAOA workshops were held in Budapest (2003) and Rome (2004).
Approximation and online algorithms ; Vol.3351 ; 2nd international workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of fields. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. Topics of interests for WAOA2004 were : applications to game theory, appr- imation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, in approximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. on the reviews, This volume contains the 21 selected papers
Approximation and Online Algorithms ; 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers
The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems.
Approximation and Online Algorithms ; 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers
It focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications
