Search results for "ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION"
showing 10 items of 140 documents
Vectors, Tensors, Manifolds and Special Relativity
2015
Assuming that the reader is familiar with the notion of vectors, within a few pages, with a few examples, the reader will get to be familiar with the generic picture of tensors. With the specific notions given in this chapter, the reader will be able to understand more advanced tensor courses with no further effort. The transition between tensor algebra and tensor calculus is done naturally with a very familiar example. The notion of manifold and a few basic key aspects on Special Relativity are also presented.
The Bernstein Basis and its applications in solving geometric constraint systems
2012
International audience; This article reviews the properties of Tensorial Bernstein Basis (TBB) and its usage, with interval analysis, for solving systems of nonlinear, univariate or multivariate equations resulting from geometric constraints. TBB are routinely used in computerized geometry for geometric modelling in CAD-CAM, or in computer graphics. They provide sharp enclosures of polynomials and their derivatives. They are used to reduce domains while preserving roots of polynomial systems, to prove that domains do not contain roots, and to make existence and uniqueness tests. They are compatible with standard preconditioning methods and fit linear program- ming techniques. However, curre…
Data for: Analytical induced force solution in conducting cylindrical bodies and rings due to a rotating finite permanent magnet
2019
Implementation of analytical current density solution in numerical calculations using Wolfram Mathematica software. THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
On a new proof of Moser's twist mapping theorem
1976
Based on a new idea of the author, a new proof of J. Moser's twist mapping theorem is presented.
Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers
2001
The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial differential eigenvalue problems in two- or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the inverted eigenvalue problem. Under suitable assumptions, the number of Lanczos iterations is shown to be independent of the problem size. The arising linear problems are solved using some standard fast elliptic solver. Numerical experiments demonstrate that the inverted problem is much easier to solve with the Lanczos…
A biproportional filter to compare technical and allocation coefficient variations
1997
International audience; In input-output analysis there are two alternate possibilities between Leontief's mechanism (fixed technical coefficients) and Ghosh's mechanism (fixed allocation coefficients). Testing the long term consistency of these mechanisms entails comparing input-output matrices over time. This paper challenges the value of proportional filters (separate comparison of column and row coefficients) and introduces the biproportional filter which allows simultaneous comparison of column and rows. An application is proposed using French input-output tables for 1980 and 1993. The stability of column coefficients cannot be taken for granted and generally, for any sector, both rows …
A True Extension of the Markov Inequality to Negative Random Variables
2020
The Markov inequality is a classical nice result in statistics that serves to demonstrate other important results as the Chebyshev inequality and the weak law of large numbers, and that has useful applications in the real world, when the random variable is unspecified, to know an upper bound for the probability that an variable differs from its expectation. However, the Markov inequality has one main flaw: its validity is limited to nonnegative random variables. In the very short note, we propose an extension of the Markov inequality to any non specified random variable. This result is completely new.
Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean
2015
Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…
The Linear Ordering Polytope
2010
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.
RationalizeRoots: Software package for the rationalization of square roots
2020
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.