Search results for "Applied Mathematics"
showing 10 items of 4379 documents
Iterative approximation to a coincidence point of two mappings
2015
In this article two methods for approximating the coincidence point of two mappings are studied and moreover, rates of convergence for both methods are given. These results are illustrated by several examples, in particular we apply such results to study the convergence and their rate of convergence of these methods to the solution of a nonlinear integral equation and of a nonlinear differential equation.
OPKINE, a multipurpose program for kinetics
1991
The program OPKINE is presented for the study of reaction mechanisms and multicomponent analysis in dynamic conditions. This program is written in FORTRAN-77 for IBM 30/90 and VAX 8300 computers, and permits the simultaneous evaluation of both rate constants and initial reagent concentrations or, alternatively, rate constants and sensitivities. Up to 20 kinetic curves, with up to 400 points each, can be treated to evaluate up to 40 parameters. Integration of the system of differential equations is performed by means of the Runge–Kutta–Fehlberg method. OPKINE is provided with the Simplex, and modified versions of the Davidon–Fletcher–Powell and Gauss–Newton–Marquardt optimization methods. A …
The windowed scalogram difference: A novel wavelet tool for comparing time series
2017
Abstract We introduce a new wavelet-based tool called windowed scalogram difference (WSD), which has been designed to compare time series. This tool allows quantifying if two time series follow a similar pattern over time, comparing their scalograms and determining if they give the same weight to the different scales. The WSD can be seen as an alternative to another tool widely used in wavelet analysis called wavelet squared coherence (WSC) and, in some cases, it detects features that the WSC is not able to identify. As an application, the WSD is used to examine the dynamics of the integration of government bond markets in the euro area since the inception of the euro as a European single c…
On optimal estimates for the solutions of linear difference equations on the circle
1976
A linear difference equation arising in the proof of Moser's twist mapping theorem is solved and optimal estimates for the solution are established.
Navigationsformel zu A. Busemanns Variationsproblem der Raumfahrt
1970
Die Indikatrix des Variationsproblems wird auser durch die Storungsdifferentialgleichung fur die grose Halbachse und die Exzentrizitat durch einen Zusammenhang zwischen der Richtung des Impulsausstoses und der exzentrischen Anomalie gegeben. Die Hamilton-Gleichungen einer Extremalen reduzieren sich dann auf eine Navigationsgleichung. Die restlichen Storungsgleichungen fur die Perihellange und die mittlere Lange der Epoche geben schlieslich den sparsamsten zeitlichen Ablauf des Raketenausstoses.
Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III
1980
In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…
Maximale Konvergenzordnung bei der numerischen Lösung von Anfangswertproblemen mit Splines
1982
In [10] a general procedureV is presented to obtain spline approximations by collocation for the solutions of initial value problems for first order ordinary differential equations. In this paper the attainable order of convergence with respect to the maximum norm is characterized in dependence of the parameters involved inV; in particular the appropriate choice of the collocation points is considered.
On the path representation of networks
1982
A compact data structure for networks is obtained by storing arcs of paths sequentially. This structure allows forward and backward access from a node to its neighbors.
Network structure and optimal technological innovation
2019
The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…
An automatic L1-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks
2023
Fast Field-Cycling Nuclear Magnetic Resonance relaxometry is a non-destructive technique to investigate molecular dynamics and structure of systems having a wide range of ap- plications such as environment, biology, and food. Besides a considerable amount of liter- ature about modeling and application of such technique in specific areas, an algorithmic approach to the related parameter identification problem is still lacking. We believe that a robust algorithmic approach will allow a unified treatment of different samples in several application areas. In this paper, we model the parameters identification problem as a con- strained L 1 -regularized non-linear least squares problem. Following…