Search results for "Computational Mathematic"
showing 10 items of 987 documents
IMFLer: A Web Application for Interactive Metabolic Flux Analysis and Visualization.
2021
Increasing genome-wide data in biological sciences and medicine has contributed to the development of a variety of visualization tools. Several automatic, semiautomatic, and manual visualization tools have already been developed. Some even have integrated flux balance analysis (FBA), but in most cases, it depends on separately installed third party software that is proprietary and does not allow customization of its functionality and has many restrictions for easy data distribution and analysis. In this study, we present an interactive metabolic flux analyzer and visualizer (IMFLer)-a static single-page web application that enables the reading and management of metabolic model layout maps, …
Un élément fini mixte tridimensionnel pour le calcul des contraintes d'interface
1999
ABSTRACT In this paper we present an interfacial finite element designed for analysing planar interfaces in a three-dimensional approach. The element is derived from Hellinger-Reissner's mixed variational principle and takes into account the continuity of the displacement and of the transverse stress components through the interface. Stress analysis of a sandwich plate is made to assess the validity and the effectiveness of the element models, with comparisons to closed-form and numerical solutions.
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
Minimal star-varieties of polynomial growth and bounded colength
2018
Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…
Polynomial growth and star-varieties
2016
Abstract Let V be a variety of associative algebras with involution over a field F of characteristic zero and let c n ⁎ ( V ) , n = 1 , 2 , … , be its ⁎-codimension sequence. Such a sequence is polynomially bounded if and only if V does not contain the commutative algebra F ⊕ F , endowed with the exchange involution, and M, a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices. Such algebras generate the only varieties of ⁎-algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all subvarieties of the ⁎-varieties of almost polynomial growth by gi…
Some characterizations of algebras with involution with polynomial growth of their codimensions
2018
Let A be an associative algebra endowed with an involution ∗ of the first kind and let c ∗n (A) denote the sequence of ∗-codimensions of A. In this paper, we are interested in algebras with involution such that the ∗-codimension sequence is polynomially bounded. We shall prove that A is of this kind if and only if it satisfies the same identities of a finite direct sum of finite dimensional algebras with involution A i , each of which with Jacobson radical of codimension less than or equal to one in A i . We shall also relate the condition of having polynomial codimension growth with the sequence of cocharacters and with the sequence of colengths. Along the way, we shall show that the multi…
A data aggregation strategy based on wavelet for the internet of things
2017
The advent of emerging information and communication technologies, such as RFID, small size sensors and sensor networks, has made accessible a huge amount of information that requires sophisticated and efficient search algorithms to support queries on that data. In this paper we focus on the problem of aggregating data collected from these devices to efficiently support queries, inferences or statistics on them. In general, data aggregation techniques are necessary to efficiently collect information in a compact and cost-effective way. Some current solutions try to meet the above criteria, by exploiting different data aggregation techniques, for instance BitVector or Q_Digest. In this manus…
The smoothed particle hydrodynamics method via residual iteration
2019
Abstract In this paper we propose for the first time an iterative approach of the Smoothed Particle Hydrodynamics (SPH) method. The method is widespread in many areas of science and engineering and despite its extensive application it suffers from several drawbacks due to inaccurate approximation at boundaries and at irregular interior regions. The presented iterative process improves the accuracy of the standard method by updating the initial estimates iterating on the residuals. It is appealing preserving the matrix-free nature of the method and avoiding to modify the kernel function . Moreover the process refines the SPH estimates and it is not affected by disordered data distribution. W…
�ber ein Verfahren der Ordnung $$1 + \sqrt 2 $$ zur Nullstellenbestimmung
1979
A new iterative method for solving nonlinear equations is presented which is shown to converge locally withR-order of convergence $$1 + \sqrt 2 $$ at least under suitable differentiability assumptions. The method needs as many function evaluations per step as the classical Newton method.
Some supplementary results on the 1+ $$\sqrt 2 $$ order method for the solution of nonlinear equations
1982
Recently an iterative method for the solution of systems of nonlinear equations having at leastR-order 1+ $$\sqrt 2 $$ for simple roots has been investigated by the author [7]; this method uses as many function evaluations per step as the classical Newton method. In the present note we deal with several properties of the method such as monotone convergence, asymptotic inclusion of the solution and convergence in the case of multiple roots.