52 research outputs found
Recommended from our members
Finite-dimensional Approximations of Discrete Groups
The main objective of this workshop was to bring together experts from various fields, which are all interested in finite and finite-dimensional approximations of infinite algebraic and analytic objects, such as groups, algebras, dynamical systems, group actions, or even von Neumann algebras
Dynamical Systems on Spectral Metric Spaces
Let (A,H,D) be a spectral triple, namely: A is a C*-algebra, H is a Hilbert
space on which A acts and D is a selfadjoint operator with compact resolvent
such that the set of elements of A having a bounded commutator with D is dense.
A spectral metric space, the noncommutative analog of a complete metric space,
is a spectral triple (A,H,D) with additional properties which guaranty that the
Connes metric induces the weak*-topology on the state space of A. A
*-automorphism respecting the metric defined a dynamical system. This article
gives various answers to the question: is there a canonical spectral triple
based upon the crossed product algebra AxZ, characterizing the metric
properties of the dynamical system ? If is the noncommutative analog
of an isometry the answer is yes. Otherwise, the metric bundle construction of
Connes and Moscovici is used to replace (A,) by an equivalent dynamical
system acting isometrically. The difficulties relating to the non compactness
of this new system are discussed. Applications, in number theory, in coding
theory are given at the end
Recommended from our members
The Foundations of Infinite-Dimensional Spectral Computations
Spectral computations in infinite dimensions are ubiquitous in the sciences. However, their many applications and theoretical studies depend on computations which are infamously difficult. This thesis, therefore, addresses the broad question,
“What is computationally possible within the field of spectral theory of separable Hilbert spaces?”
The boundaries of what computers can achieve in computational spectral theory and mathematical physics are unknown, leaving many open questions that have been unsolved for decades. This thesis provides solutions to several such long-standing problems.
To determine these boundaries, we use the Solvability Complexity Index (SCI) hierarchy, an idea which has its roots in Smale's comprehensive programme on the foundations of computational mathematics. The Smale programme led to a real-number counterpart of the Turing machine, yet left a substantial gap between theory and practice. The SCI hierarchy encompasses both these models and provides universal bounds on what is computationally possible. What makes spectral problems particularly delicate is that many of the problems can only be computed by using several limits, a phenomenon also shared in the foundations of polynomial root-finding as shown by McMullen. We develop and extend the SCI hierarchy to prove optimality of algorithms and construct a myriad of different methods for infinite-dimensional spectral problems, solving many computational spectral problems for the first time.
For arguably almost any operator of applicable interest, we solve the long-standing computational spectral problem and construct algorithms that compute spectra with error control. This is done for partial differential operators with coefficients of locally bounded total variation and also for discrete infinite matrix operators. We also show how to compute spectral measures of normal operators (when the spectrum is a subset of a regular enough Jordan curve), including spectral measures of classes of self-adjoint operators with error control and the construction of high-order rational kernel methods. We classify the problems of computing measures, measure decompositions, types of spectra (pure point, absolutely continuous, singular continuous), functional calculus, and Radon--Nikodym derivatives in the SCI hierarchy. We construct algorithms for and classify; fractal dimensions of spectra, Lebesgue measures of spectra, spectral gaps, discrete spectra, eigenvalue multiplicities, capacity, different spectral radii and the problem of detecting algorithmic failure of previous methods (finite section method). The infinite-dimensional QR algorithm is also analysed, recovering extremal parts of spectra, corresponding eigenvectors, and invariant subspaces, with convergence rates and error control. Finally, we analyse pseudospectra of pseudoergodic operators (a generalisation of random operators) on vector-valued spaces.
All of the algorithms developed in this thesis are sharp in the sense of the SCI hierarchy. In other words, we prove that they are optimal, realising the boundaries of what digital computers can achieve. They are also implementable and practical, and the majority are parallelisable. Extensive numerical examples are given throughout, demonstrating efficiency and tackling difficult problems taken from mathematics and also physical applications.
In summary, this thesis allows scientists to rigorously and efficiently compute many spectral properties for the first time. The framework provided by this thesis also encompasses a vast number of areas in computational mathematics, including the classical problem of polynomial root-finding, as well as optimisation, neural networks, PDEs and computer-assisted proofs. This framework will be explored in the future work of the author within these settings
Development and applications of the Finite Point Method to compressible aerodynamics problems
This work deals with the development and application of the Finite Point Method (FPM) to compressible aerodynamics problems. The research focuses mainly on investigating the capabilities of the meshless technique to address practical problems, one of the most outstanding issues in meshless methods.
The FPM spatial approximation is studied firstly, with emphasis on aspects of the methodology that can be improved to increase its robustness and accuracy. Suitable ranges for setting the relevant approximation parameters and the performance likely to be attained in practice are determined. An automatic procedure to adjust the approximation parameters is also proposed to simplify the application of the method, reducing problem- and user-dependence without affecting the flexibility of the meshless technique.
The discretization of the flow equations is carried out following wellestablished approaches, but drawing on the meshless character of the
methodology. In order to meet the requirements of practical applications, the procedures are designed and implemented placing emphasis on robustness and efficiency (a simplification of the basic FPM technique is proposed to this end). The flow solver is based on an upwind spatial discretization of the convective fluxes (using the approximate Riemann solver of Roe) and an explicit time integration scheme. Two additional artificial diffusion schemes are also proposed to suit those cases of study in which computational cost is a major concern. The performance of the flow solver is evaluated in order to determine the potential of the meshless approach. The accuracy, computational cost and parallel scalability of the method are studied in comparison with a conventional FEM-based technique.
Finally, practical applications and extensions of the flow solution scheme are presented. The examples provided are intended not only to show the
capabilities of the FPM, but also to exploit meshless advantages. Automatic hadaptive procedures, moving domain and fluid-structure interaction problems, as well as a preliminary approach to solve high-Reynolds viscous flows, are a sample of the topics explored.
All in all, the results obtained are satisfactorily accurate and competitive in terms of computational cost (if compared with a similar mesh-based
implementation). This indicates that meshless advantages can be exploited with efficiency and constitutes a good starting point towards more challenging applications.En este trabajo se aborda el desarrollo del Método de Puntos Finitos (MPF) y su aplicación a problemas de aerodinámica de flujos compresibles. El objetivo principal es investigar el potencial de la técnica sin malla para la solución de problemas prácticos, lo cual constituye una de las limitaciones más importantes de los métodos sin malla.
En primer lugar se estudia la aproximación espacial en el MPF, haciendo hincapié en aquéllos aspectos que pueden ser mejorados para incrementar la robustez y exactitud de la metodología. Se determinan rangos adecuados para el ajuste de los parámetros de la aproximación y su comportamiento en situaciones prácticas. Se propone además un procedimiento de ajuste automático de estos parámetros a fin de simplificar la aplicación del método y reducir la dependencia de factores como el tipo de problema y la intervención del usuario, sin afectar la flexibilidad de la técnica sin malla.
A continuación se aborda el esquema de solución de las ecuaciones del flujo. La discretización de las mismas se lleva a cabo siguiendo métodos estándar, pero aprovechando las características de la técnica sin malla. Con el objetivo de abordar problemas prácticos, se pone énfasis en la robustez y eficiencia de la implementación numérica (se propone además una simplificación del procedimiento de solución). El comportamiento del esquema se estudia en detalle para evaluar su potencial y se analiza su exactitud, coste computacional y escalabilidad, todo ello en comparación con un método convencional basado en Elementos Finitos.
Finalmente se presentan distintas aplicaciones y extensiones de la metodología desarrollada. Los ejemplos numéricos pretenden demostrar las
capacidades del método y también aprovechar las ventajas de la metodología sin malla en áreas en que la misma puede ser de especial interés. Los problemas tratados incluyen, entre otras características, el refinamiento automático de la discretización, la presencia de fronteras móviles e
interacción fluido-estructura, como así también una aplicación preliminar a flujos compresibles de alto número de Reynolds. Los resultados obtenidos muestran una exactitud satisfactoria. Además, en comparación con una técnica similar basada en Elementos Finitos, demuestran ser competitivos en términos del coste computacional. Esto indica que las ventajas de la metodología sin malla pueden ser explotadas con eficiencia, lo cual constituye un buen punto de partida para el desarrollo de ulteriores aplicaciones.Postprint (published version
Development and applications of the finite point method to compressible aerodynamics problems
This work deals with the development and application of the Finite Point
Method (FPM) to compressible aerodynamics problems. The research focuses
mainly on investigating the capabilities of the meshless technique to address
practical problems, one of the most outstanding issues in meshless methods.
The FPM spatial approximation is studied firstly, with emphasis on aspects of
the methodology that can be improved to increase its robustness and accuracy.
Suitable ranges for setting the relevant approximation parameters and the
performance likely to be attained in practice are determined. An automatic
procedure to adjust the approximation parameters is also proposed to simplify
the application of the method, reducing problem- and user-dependence
without affecting the flexibility of the meshless technique.
The discretization of the flow equations is carried out following wellestablished
approaches, but drawing on the meshless character of the methodology. In order to meet the requirements of practical applications, the procedures are designed and implemented placing emphasis on robustness and efficiency (a simplification of the basic FPM technique is proposed to this end). The flow solver is based on an upwind spatial discretization of the convective fluxes (using the approximate Riemann solver of Roe) and an explicit time integration scheme. Two additional artificial diffusion schemes are also proposed to suit those cases of study in which computational cost is a major concern. The performance of the flow solver is evaluated in order to determine the potential of the meshless approach. The accuracy, computational cost and parallel scalability of the method are studied in
comparison with a conventional FEM-based technique.
Finally, practical applications and extensions of the flow solution scheme are
presented. The examples provided are intended not only to show the
capabilities of the FPM, but also to exploit meshless advantages. Automatic hadaptive procedures, moving domain and fluid-structure interaction problems,
as well as a preliminary approach to solve high-Reynolds viscous flows, are a
sample of the topics explored.
All in all, the results obtained are satisfactorily accurate and competitive in
terms of computational cost (if compared with a similar mesh-based
implementation). This indicates that meshless advantages can be exploited
with efficiency and constitutes a good starting point towards more challenging
applications
Notes in Pure Mathematics & Mathematical Structures in Physics
These Notes deal with various areas of mathematics, and seek reciprocal
combinations, explore mutual relations, ranging from abstract objects to
problems in physics.Comment: Small improvements and addition
- …