Search results for "linear"

showing 10 items of 7165 documents

Identification of stiffness,dissipation and input parameters of randomly excited non-linear systems: Capability of restricted potential models (RPM)

2006

Abstract A dynamic identification technique in the time domain for time invariant systems under random external forces is presented. This technique is based on the use of the class of restricted potential models (RPM), which are characterized by a non-linear stiffness and a special form of damping, that is a product of the input power spectral density (PSD) matrix and the velocity gradient of a non-linear function of the total mechanical energy. By applying It o ^ stochastic differential calculus and by specific analytical manipulations, some algebraic equations, depending on the response statistics and on the mechanic parameters that characterize RPM, are obtained. These equations can be u…

Applied MathematicsMechanical EngineeringMathematical analysisinput identificationSystem identificationWhite noiseFunction (mathematics)LTI system theoryNonlinear systemMatrix (mathematics)Ito calculuSettore ICAR/09 - Tecnica Delle Costruzionipotential modelMechanics of MaterialsControl theoryTime domainwhite noiseMechanical energyMathematicssystem identification
researchProduct

Elastic plastic analysis iterative solution

1998

The step-by-step analysis of finite element elastic plastic structures subjected to an assigned (quasi-static) loading history, is considered; it identifies with the well-known sequence of linear complementarity problems. An iterative technique devoted to solve the relevant linear complementarity problem is presented. It is based on the recursive solution of a suitable linear complementarity problem, deduced from the relevant one and easier than it. The procedure convergency is proved. Some noticing particular cases are examined. The physical meaning of the procedure is shown to be a plastic relaxation. The suitable numerical ranges for some check parameter values, to be utilized in the app…

Applied MathematicsMechanical EngineeringNumerical analysisComputational MechanicsOcean EngineeringComplementarity (physics)Linear complementarity problemFinite element methodElastic plasticComputational MathematicsComputational Theory and MathematicsComputational Science and EngineeringApplied mathematicsAlgorithmMathematicsComputational Mechanics
researchProduct

One-dimensional families of projections

2008

Let m and n be integers with 0 < m < n. We consider the question of how much the Hausdorff dimension of a measure may decrease under typical orthogonal projections from onto m-planes provided that the dimension of the parameter space is one. We verify the best possible lower bound for the dimension drop and illustrate the sharpness of our results by examples. The question stems naturally from the study of measures which are invariant under the geodesic flow.

Applied MathematicsMinkowski–Bouligand dimensionGeneral Physics and AstronomyDimension functionStatistical and Nonlinear PhysicsGeometryParameter spaceEffective dimensionUpper and lower boundsCombinatoricsPacking dimensionHausdorff dimensionInvariant (mathematics)Mathematical PhysicsMathematicsNonlinearity
researchProduct

Numerical Algorithms Based on Characteristic Domain Decomposition for Obstacle Problems

1997

A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to genuinely non-linear obstacle problems. Other solution algorithms, like projected relaxation methods and active set strategies, are compared to the new solution algorithm. Numerical experiments related to the elastoplastic torsion problem are included showing the efficiency of the new approach.

Applied MathematicsNumerical analysisLinear systemGeneral EngineeringBoundary (topology)Domain decomposition methodsComputational Theory and MathematicsModeling and SimulationObstacleObstacle problemVariational inequalityTorsion (algebra)AlgorithmSoftwareMathematicsCommunications in Numerical Methods in Engineering
researchProduct

Comparison of discretization strategies for the model-free information-theoretic assessment of short-term physiological interactions

2023

This work presents a comparison between different approaches for the model-free estimation of information-theoretic measures of the dynamic coupling between short realizations of random processes. The measures considered are the mutual information rate (MIR) between two random processes [Formula: see text] and [Formula: see text] and the terms of its decomposition evidencing either the individual entropy rates of [Formula: see text] and [Formula: see text] and their joint entropy rate, or the transfer entropies from [Formula: see text] to [Formula: see text] and from [Formula: see text] to [Formula: see text] and the instantaneous information shared by [Formula: see text] and [Formula: see…

Applied MathematicsSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGeneral Physics and AstronomyStatistical and Nonlinear PhysicsInformation-theoretic measures mutual information rate (MIR) binning permutation time-series analysisMathematical Physics
researchProduct

Linear response theory: preliminaries

2013

Applied mathematicsLinear response theoryMathematics
researchProduct

Influence of Active Device Nonlinearities on the Determination of Adler's Injection.Locking Q-Factor

2011

The problem of the correct evaluation of Q-factor appearing in Adler's equation for injection-locking is addressed. Investigation has shown that recent results presented in the literature, while extending applicability of the original method, do not completely account for nonlinear effects occurring when two-port active devices are involved. To overcome such limitation, use can be made of a newly developed theory in the dynamical complex envelope domain, capable of providing first-approximation exact dynamical models of driven quasi-sinusoidal oscillators. Some preliminary results are presented here concerning a class of injection-locked oscillators with single-loop feedback type configurat…

Approximation theoryBandwidth (signal processing)TransistorActive devicesSettore ING-INF/01 - Elettronicalaw.inventionInjection lockingNonlinear systemControl theorylawQ factorNonlinear circuits Adler Q FactorColpitts oscillatorMathematics
researchProduct

On spline methods of approximation under L-fuzzy information

2011

This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.

Approximation theoryClassical theorySpline (mathematics)Mathematical optimizationComputingMethodologies_PATTERNRECOGNITIONBox splineFuzzy setLinear problemApplied mathematicsApproximation algorithmFuzzy logicMathematics2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2011)
researchProduct

Convergence of KAM iterations for counterterm problems

1998

Abstract We analyse two iterative KAM methods for counterterm problems for finite-dimensional matrices. The starting point for these methods is the KAM iteration for Hamiltonians linear in the action variable in classical mechanics. We compare their convergence properties when a perturbation parameter is varied. The first method has no fixed points beyond a critical value of the perturbation parameter. The second one has fixed points for arbitrarily large perturbations. We observe different domains of attraction separated by Julia sets.

Arbitrarily largeGeneral MathematicsApplied MathematicsMathematical analysisGeneral Physics and AstronomyPerturbation (astronomy)Statistical and Nonlinear PhysicsFixed pointAction variableCritical valueJulia setMathematicsChaos, Solitons &amp; Fractals
researchProduct

A comparison of two different formulations for Arc Routing Problems on Mixed graphs

2006

[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.

Arc routingGeneral Computer ScienceLinear programmingMixed Chinese postman problemMixed graphMixed rural postman problemManagement Science and Operations ResearchRoute inspection problemTree traversalModeling and SimulationEnhanced Data Rates for GSM EvolutionRouting (electronic design automation)Mixed general routing problemMATEMATICA APLICADAAlgorithmArc routingMathematicsVariable (mathematics)
researchProduct