Low Complexity Algorithms for Linear Recurrences

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over the rational numbers. The algorithms for these tasks all involve as an intermediate quantity an integer $N$ (dispersion or root of an indicial polynomial) that is potentially exponential in the bit size of their input. Previous algorithms have a bit complexity that is at least quadratic in $N$. We revisit them and propose variants that exploit the structure of solutions and avoid expanding polynomials of degree $N$. We give two algorithms: a probabilistic one that detects the existence or absence of nonzero polynomial and rational solutions in $O(\sqrt{N}\log^{2}N)$ bit operations; a deterministic one that computes a compact representation of the solution in $O(N\log^{3}N)$ bit operations. Similar speed-ups are obtained in indefinite and definite hypergeometric summation. We describe the results of an implementation.Comment: This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistributio

Serre's reduction of linear systems of partial differential equations with holonomic adjoints

Given a linear functional system (e.g., ordinary/partial di erential system, di erential time-delay system, di erence system), Serre's reduction aims at nding an equivalent linear functional system which contains fewer equations and fewer unknowns. The purpose of this paper is to study Serre's reduction of underdetermined linear systems of partial di erential equations with either polynomial, formal power series or analytic coe cients and with holonomic adjoints in the sense of algebraic analysis. We prove that these linear partial di erential systems can be de ned by means of a single linear partial di erential equation. In the case of polynomial coe cients, we give an algorithm to compute the corresponding equation

Serre's reduction of linear partial differential systems with holonomic adjoints

Given a linear functional system (e.g., ordinary/partial differential systems, differential time-delay systems, difference systems), Serre's reduction aims at finding an equivalent linear functional system which contains fewer equations and fewer unknowns. The purpose of this paper is to study Serre's reduction of underdetermined linear systems of partial differential equations with either polynomial, formal power series or analytic coefficients and with holonomic adjoints in the sense of algebraic analysis. We prove that these linear partial differential systems can be defined by means of a single linear partial differential equation. In the case of polynomial coefficients, we give an algorithm to compute the corresponding equation.Etant donné un système fonctionnel linéaire (e.g., système d'équations différentielles ordinaires, système d'équations aux dérivées partielles, système d'équations différentielles à retard, système d'équations aux différences), la réduction de Serre a pour but de trouver un système fonctionnel linéaire équivalent contenant moins d'équations et d'inconnues. L'objectif de ce papier est l'étude de la réduction de Serre des systèmes linéaires sous-déterminés d'équations aux dérivées partielles à coefficients polynomiaux, séries formelles ou séries localement convergentes, dont les adjoints sont holonomes au sens de l'analyse algébrique. Nous prouvons que de tels systèmes peuvent être définis par une seule équation aux dérivées partielles. Dans le cas des coefficients polynomiaux, nous donnons un algorithme permettant de calculer l'équation correspondante

Symbolic methods for developing new domain decomposition algorithms

The purpose of this work is to show how algebraic and symbolic techniques such as Smith normal forms and Gröbner basis techniques can be used to develop new Schwarz-like algorithms and preconditioners for linear systems of partial differential equationsL'objet de ce travail est de monter comment les techniques algébriques et symboliques telles que les formes normales de Smith et les techniques de bases de Gröbner peuvent être utilisées pour développer de nouveaux algorithmes de type Schwarz et des préconditionneurs pour les systèmes linéaires d'équations aux dérivées partielles

Undulation instabilities in the meniscus of smectic membranes

Using optical microscopy, phase shifting interferometry and atomic force microscopy, we demonstrate the existence of undulated structures in the meniscus of ferroelectric smectic-C* films. The meniscus is characterized by a periodic undulation of the smectic-air interface, which manifests itself in a striped pattern. The instability disappears in the untilted smectic-A phase. The modulation amplitude and wavelength both depend on meniscus thickness. We study the temperature evolution of the structure and propose a simple model that accounts for the observed undulations.Comment: Submitted to PR

On the effect of buoyancy on lateral migration of bubbles in turbulent flows insights from Direct Numerical Simulations

International audienceBubble migration is a key concern in turbulent bubbly flows as it dramatically affects momentum and mass transfers between phases. Its prediction in steam-water conditions relevant to PWR applications is difficult to assess because experiments are often conducted with air/water flows that present substantially different properties. The effect of the deformability of bubbles on the lift force has been extensively studied experimentally, or numerically, and characterized based on the Eotvos and Reynolds numbers. Nonetheless, the effect of buoyancy is not well understood. The strength of gravity and the resultant enhancement of turbulence can have a significant impact on bubble migration in the cross-flow direction.In this work, we propose to use Direct Numerical Simulations (DNS) of turbulent bubbly flows to better understand the dominant physical mechanisms at play and cover ranges of conditions difficult to access experimentally. DNS offers a rich insight into the underlying physical phenomena and allows us to control the relative importance of different sub-physics. Starting from the flow conditions studied by Lu and Tryggvason [1], we perform four DNS of bubbly flows at a slightly higher Reynolds friction number, covering deformable and almost-spherical bubbles in weakly-buoyant or buoyant conditions. Separate effects of the Eotvos number and of an increasing gravitational force are assessed. Mean quantities, Reynolds stresses and higher-order statistics are computed to analyze the effect of bubbles on liquid turbulence levels, which influences the wall-normal void fraction profile. New insights on the way bubbles alters liquid turbulence levels and influence the lateral migration of bubbles are presented. Further experimental and numerical studies are required to support and extend this analysis

Clinical practice guidelines: towards better quality guidelines and increased international collaboration

Item does not contain fulltex

Symbolic preconditioning techniques for linear systems of partial differential equations

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on the number of degrees on freedom and number of subdomains) and have limited memory requirements. They are preconditioned by domain decomposition methods, incomplete factorizations and multigrid preconditioners. These techniques are well understood and efficient for scalar symmetric equations (e.g., Laplacian, biLaplacian) and to some extent for non-symmetric equations (e.g., convection-diffusion). But they have poor performances and lack robustness when used for symmetric systems of PDEs, and even more so for non-symmetric complex systems (fluid mechanics, porous media ...). As a general rule, the study of iterative solvers for systems of PDEs as opposed to scalar PDEs is an underdeveloped subject. We aim at building new robust and efficient solvers, such as domain decomposition methods and preconditioners for some linear and well-known systems of PDEs

Efficient Algorithms for Computing Rational First Integrals and Darboux Polynomials of Planar Polynomial Vector Fields

International audienceWe present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach builds upon a method proposed by Ferragut and Giacomini, whose main ingredients are the calculation of a power series solution of a first order differential equation and the reconstruction of a bivariate polynomial annihilating this power series. We provide explicit bounds on the number of terms needed in the power series. This enables us to transform their method into a certified algorithm computing rational first integrals via systems of linear equations. We then significantly improve upon this first algorithm by building a probabilistic algorithm with arithmetic complexity $\~O(N^{2 \omega})$ and a deterministic algorithm solving the problem in at most $\~O(d^2N^{2 \omega+1})$ arithmetic operations, where~$N$ denotes the given bound for the degree of the rational first integral, and where $d \leq N$ is the degree of the vector field, and $\omega$ the exponent of linear algebra. We also provide a fast heuristic variant which computes a rational first integral, or fails, in $\~O(N^{\omega+2})$ arithmetic operations. By comparison, the best previous algorithm uses at least $d^{\omega+1}\, N^{4\omega +4}$ arithmetic operations. We then show how to apply a similar method to the computation of Darboux polynomials. The algorithms are implemented in a Maple package RationalFirstIntegrals which is available to interested readers with examples showing its efficiency

Développement de méthodes de synthèse pour les acides aminés indolizidin-9-ones substitués et utilisation des acides aminés azabicycloalcanes en tant que mimes peptidiques

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal