Search results for "Numerical"
showing 10 items of 2002 documents
Two-Dimensional Orthogonal Wavelets and Wavelet Packets
2018
This chapter extends the design of spline-based orthogonal discrete-time wavelets and wavelet packets to two-dimensional case. The corresponding transforms are implemented by using the 2D FFT.
Discrete-Time Periodic Wavelet Packets
2014
Direct and inverse wavelet and wavelet packet transforms of a spline are implemented by filtering the spline’s coordinates by two-channel critically sampled p-filter banks. In this chapter, those p-filter banks are utilized for processing discrete-time signals. The p-filter banks generate discrete-time wavelets and wavelet packets in the spaces of 1D and 2D periodic signals.
Some efficient algorithms for the solution of a single nonlinear equation
1981
High order methods for the numerical solution of nonlinear scalar equations are proposed which are more efficient than known procedures, and a unified approach to various methods suggested in literature is given.
Non-linear systems under impulsive parametric input
1999
In this paper the problem of the response of non-linear systems excited by an impulsive parametric input is treated. For such systems the response exhibits a jump depending on the amplitude of the impulse as well as on the value of the state variables immediately before the impulse occurrence. Recently, the jump prediction has been obtained in a series form. Here the incremental rule for any scalar real valued function is obtained in an analytical form involving the jump of the state variables. It is also shown that the formulation for the jump evaluation is also able to give a new step-by-step integration technique.
A comparison of simplex and simulated annealing for optimization of a new rear underrun protective device
2012
In this paper, two optimization approaches to improve the product design process have been analysed. Through the analysis of a case study, concerning the designing of a new High Energy Absorption Rear Underrun Protective Device (HEARUPD), two different optimization approaches (simplex and simulated annealing) have been compared. In the implemented optimization processes, the crash between an economy car and the rear part of a truck has been simulated by dynamic numerical (FEM) analyses. Moreover, authors have proposed the use of a suitable linear function of four variables with the purpose of reducing the multi-objective optimization processes to mono-objective ones. That has been made to s…
Separatrix reconstruction to identify tipping points in an eco-epidemiological model
2018
Many ecological systems exhibit tipping points such that they suddenly shift from one state to another. These shifts can be devastating from an ecological point of view, and additionally have severe implications for the socio-economic system. They can be caused by overcritical perturbations of the state variables such as external shocks, disease emergence, or species removal. It is therefore important to be able to quantify the tipping points. Here we present a study of the tipping points by considering the basins of attraction of the stable equilibrium points. We address the question of finding the tipping points that lie on the separatrix surface, which partitions the space of system traj…
Statistical correlation of fractional oscillator response by complex spectral moments and state variable expansion
2016
Abstract The statistical characterization of the oscillator response with non-integer order damping under Gaussian noise represents an important challenge in the modern stochastic mechanics. In fact, this kind of problem appears in several issues of different type (wave propagation in viscoelastic media, Brownian motion, fluid dynamics, RLC circuit, etc.). The aim of this paper is to provide a stochastic characterization of the stationary response of linear fractional oscillator forced by normal white noise. In particular, this paper shows a new method to obtain the correlation function by exact complex spectral moments. These complex quantities contain all the information to describe the r…
Inversion of matrix pencils for generalized systems
1993
Abstract This paper clarifies the nature of the Leverrier-Faddeev algorithm for generalized and state-space systems. It presents useful diagrams for recursive computation of the coefficients of the characteristic polynomial and the coefficient matrices of the adjoint matrix for various matrix pencils. A simplified case covers recursive equations and diagrams for inversion of the second-order matrix pencil (Es2 + A1s + A0) where E may be singular. The appendix provides two examples of mechanical and heat exchange systems which can be described by the generalized models.
On-line Construction of Two-Dimensional Suffix Trees
1999
AbstractWe say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1,n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1,n], we have the suffix tree forx[1,i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression m…
Binary distributions of concentric rings
2014
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single parameter. It is an outstanding feature of these distributions that joint probabilities relate to evenly spaced concentric rings. Kronecker product characterizations make them computationally attractive for a large number of variables. We study the behavior of different measures of dependence and derive maximum likelihood estimates when all nodes are observed and when the inner node is hidden.