Search results for "Computational Mathematic"
showing 10 items of 987 documents
Frictionless contact-detachment analysis: iterative linear complementarity and quadratic programming approaches.
2012
The object of the paper concerns a consistent formulation of the classical Signorini’s theory regarding the frictionless contact problem between two elastic bodies in the hypothesis of small displacements and strains. The employment of the symmetric Galerkin boundary element method, based on boundary discrete quantities, makes it possible to distinguish two different boundary types, one in contact as the zone of potential detachment, called the real boundary, the other detached as the zone of potential contact, called the virtual boundary. The contact-detachment problem is decomposed into two sub-problems: one is purely elastic, the other regards the contact condition. Following this method…
The Bruce–Roberts Number of A Function on A Hypersurface with Isolated Singularity
2020
AbstractLet $(X,0)$ be an isolated hypersurface singularity defined by $\phi \colon ({\mathbb{C}}^n,0)\to ({\mathbb{C}},0)$ and $f\colon ({\mathbb{C}}^n,0)\to{\mathbb{C}}$ such that the Bruce–Roberts number $\mu _{BR}(f,X)$ is finite. We first prove that $\mu _{BR}(f,X)=\mu (f)+\mu (\phi ,f)+\mu (X,0)-\tau (X,0)$, where $\mu $ and $\tau $ are the Milnor and Tjurina numbers respectively of a function or an isolated complete intersection singularity. Second, we show that the logarithmic characteristic variety $LC(X,0)$ is Cohen–Macaulay. Both theorems generalize the results of a previous paper by some of the authors, in which the hypersurface $(X,0)$ was assumed to be weighted homogeneous.
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
2002
Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt?Szymanski paradigm for the computation of the longest common subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, respectively) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application to analysis…
Lossless and near-lossless image compression based on multiresolution analysis
2013
There are applications in data compression, where quality control is of utmost importance. Certain features in the decoded signal must be exactly, or very accurately recovered, yet one would like to be as economical as possible with respect to storage and speed of computation. In this paper, we present a multi-scale data-compression algorithm within Harten's interpolatory framework for multiresolution that gives a specific estimate of the precise error between the original and the decoded signal, when measured in the L"~ and in the L"p (p=1,2) discrete norms. The proposed algorithm does not rely on a tensor-product strategy to compress two-dimensional signals, and it provides a priori bound…
Robust reliable passive control of uncertain stochastic switched time-delay systems
2014
This paper investigates the problem of robust reliable passive control for a class of uncertain stochastic switched time-delay systems with actuator failures. The multiple Lyapunov functions (MLFs) technique is exploited to derive a delay-dependent sufficient condition for the stochastic switched time-delay systems to be passive and exponentially stable under a state-based switching law. Moreover, the proposed approach is extended to investigate stochastic switched systems with structured uncertainties. Finally, two numerical examples are presented to illustrate the effectiveness of the proposed method.
Robust H∞ synchronization of a hyper-chaotic system with disturbance input
2013
Abstract This paper concerns the robust control problems on the synchronization of a hyper-chaotic system with disturbance input. Using an appropriate Lyapunov function, we design the multi-dimensional and the single-dimensional robust H ∞ synchronization controllers in terms of linear matrix inequalities for the application in practical engineering. Corresponding theoretical derivations are given subsequently. Finally, some numerical simulations are provided to demonstrate the effectiveness of the proposed techniques.
A generalized Degn–Harrison reaction–diffusion system: Asymptotic stability and non-existence results
2021
Abstract In this paper we study the Degn–Harrison system with a generalized reaction term. Once proved the global existence and boundedness of a unique solution, we address the asymptotic behavior of the system. The conditions for the global asymptotic stability of the steady state solution are derived using the appropriate techniques based on the eigen-analysis, the Poincare–Bendixson theorem and the direct Lyapunov method. Numerical simulations are also shown to corroborate the asymptotic stability predictions. Moreover, we determine the constraints on the size of the reactor and the diffusion coefficient such that the system does not admit non-constant positive steady state solutions.
FPGA Implementation Of Diffusive Realization For A Distributed Control Operator
2010
International audience; We focus on the question of real-time computation for optimal distributed filtering or control applicable to MEMS Arrays. We present an algorithm for the realization of a linear operator solution to a functional equation through its application to a Lyapunov operatorial equation associated to the heat equation in one dimension. It is based on the diffusive realization, and turns to be well suited for fined grained parallel computer architecture as Field Programmable Gate Arrays (FPGA). An effective FPGA implementation has been successfully carried out. Here, we report the main implementation steps and the final measured performances.
Numerical solution of a spatio-temporal gender-structured model for hantavirus infection in rodents.
2017
In this article we describe the transmission dynamics of hantavirus in rodents using a spatio-temporal susceptible-exposed-infective-recovered (SEIR) compartmental model that distinguishes between male and female subpopulations [L.J.S. Allen, R.K. McCormack and C.B. Jonsson, Bull. Math. Biol. 68 (2006), 511--524]. Both subpopulations are assumed to differ in their movement with respect to local variations in the densities of their own and the opposite gender group. Three alternative models for the movement of the male individuals are examined. In some cases the movement is not only directed by the gradient of a density (as in the standard diffusive case), but also by a non-local convolution…
ℓ1-Penalized Methods in High-Dimensional Gaussian Markov Random Fields
2016
In the last 20 years, we have witnessed the dramatic development of new data acquisition technologies allowing to collect massive amount of data with relatively low cost. is new feature leads Donoho to define the twenty-first century as the century of data. A major characteristic of this modern data set is that the number of measured variables is larger than the sample size; the word high-dimensional data analysis is referred to the statistical methods developed to make inference with this new kind of data. This chapter is devoted to the study of some of the most recent ℓ1-penalized methods proposed in the literature to make sparse inference in a Gaussian Markov random field (GMRF) defined …