942 resultados para Second order methods
Resumo:
A Nonlinear Programming algorithm that converges to second-order stationary points is introduced in this paper. The main tool is a second-order negative-curvature method for box-constrained minimization of a certain class of functions that do not possess continuous second derivatives. This method is used to define an Augmented Lagrangian algorithm of PHR (Powell-Hestenes-Rockafellar) type. Convergence proofs under weak constraint qualifications are given. Numerical examples showing that the new method converges to second-order stationary points in situations in which first-order methods fail are exhibited.
Resumo:
We develop the a-posteriori error analysis of hp-version interior-penalty discontinuous Galerkin finite element methods for a class of second-order quasilinear elliptic partial differential equations. Computable upper and lower bounds on the error are derived in terms of a natural (mesh-dependent) energy norm. The bounds are explicit in the local mesh size and the local degree of the approximating polynomial. The performance of the proposed estimators within an automatic hp-adaptive refinement procedure is studied through numerical experiments.
Resumo:
"CM-1033."
Resumo:
We establish the existence of mild solutions for a class of impulsive second-order partial neutral functional differential equations with infinite delay in a Banach space. (C) 2009 Published by Elsevier Ltd
Resumo:
In this paper we study the approximate controllability of control systems with states and controls in Hilbert spaces, and described by a second-order semilinear abstract functional differential equation with infinite delay. Initially we establish a characterization for the approximate controllability of a second-order abstract linear system and, in the last section, we compare the approximate controllability of a semilinear abstract functional system with the approximate controllability of the associated linear system. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.
Resumo:
We start by studying the existence of positive solutions for the differential equation u '' = a(x)u - g(u), with u ''(0) = u(+infinity) = 0, where a is a positive function, and g is a power or a bounded function. In other words, we are concerned with even positive homoclinics of the differential equation. The main motivation is to check that some well-known results concerning the existence of homoclinics for the autonomous case (where a is constant) are also true for the non-autonomous equation. This also motivates us to study the analogous fourth-order boundary value problem {u((4)) - cu '' + a(x)u = vertical bar u vertical bar(p-1)u u'(0) = u'''(0) = 0, u(+infinity) = u'(+infinity) = 0 for which we also find nontrivial (and, in some instances, positive) solutions.
Resumo:
Using a suitable Hull and White type formula we develop a methodology to obtain asecond order approximation to the implied volatility for very short maturities. Using thisapproximation we accurately calibrate the full set of parameters of the Heston model. Oneof the reasons that makes our calibration for short maturities so accurate is that we alsotake into account the term-structure for large maturities. We may say that calibration isnot "memoryless", in the sense that the option's behavior far away from maturity doesinfluence calibration when the option gets close to expiration. Our results provide a wayto perform a quick calibration of a closed-form approximation to vanilla options that canthen be used to price exotic derivatives. The methodology is simple, accurate, fast, andit requires a minimal computational cost.
Resumo:
In moment structure analysis with nonnormal data, asymptotic valid inferences require the computation of a consistent (under general distributional assumptions) estimate of the matrix $\Gamma$ of asymptotic variances of sample second--order moments. Such a consistent estimate involves the fourth--order sample moments of the data. In practice, the use of fourth--order moments leads to computational burden and lack of robustness against small samples. In this paper we show that, under certain assumptions, correct asymptotic inferences can be attained when $\Gamma$ is replaced by a matrix $\Omega$ that involves only the second--order moments of the data. The present paper extends to the context of multi--sample analysis of second--order moment structures, results derived in the context of (simple--sample) covariance structure analysis (Satorra and Bentler, 1990). The results apply to a variety of estimation methods and general type of statistics. An example involving a test of equality of means under covariance restrictions illustrates theoretical aspects of the paper.
Resumo:
This paper deals with the goodness of the Gaussian assumption when designing second-order blind estimationmethods in the context of digital communications. The low- andhigh-signal-to-noise ratio (SNR) asymptotic performance of the maximum likelihood estimator—derived assuming Gaussiantransmitted symbols—is compared with the performance of the optimal second-order estimator, which exploits the actualdistribution of the discrete constellation. The asymptotic study concludes that the Gaussian assumption leads to the optimalsecond-order solution if the SNR is very low or if the symbols belong to a multilevel constellation such as quadrature-amplitudemodulation (QAM) or amplitude-phase-shift keying (APSK). On the other hand, the Gaussian assumption can yield importantlosses at high SNR if the transmitted symbols are drawn from a constant modulus constellation such as phase-shift keying (PSK)or continuous-phase modulations (CPM). These conclusions are illustrated for the problem of direction-of-arrival (DOA) estimation of multiple digitally-modulated signals.
Resumo:
This work provides a general framework for the design of second-order blind estimators without adopting anyapproximation about the observation statistics or the a prioridistribution of the parameters. The proposed solution is obtainedminimizing the estimator variance subject to some constraints onthe estimator bias. The resulting optimal estimator is found todepend on the observation fourth-order moments that can be calculatedanalytically from the known signal model. Unfortunately,in most cases, the performance of this estimator is severely limitedby the residual bias inherent to nonlinear estimation problems.To overcome this limitation, the second-order minimum varianceunbiased estimator is deduced from the general solution by assumingaccurate prior information on the vector of parameters.This small-error approximation is adopted to design iterativeestimators or trackers. It is shown that the associated varianceconstitutes the lower bound for the variance of any unbiasedestimator based on the sample covariance matrix.The paper formulation is then applied to track the angle-of-arrival(AoA) of multiple digitally-modulated sources by means ofa uniform linear array. The optimal second-order tracker is comparedwith the classical maximum likelihood (ML) blind methodsthat are shown to be quadratic in the observed data as well. Simulationshave confirmed that the discrete nature of the transmittedsymbols can be exploited to improve considerably the discriminationof near sources in medium-to-high SNR scenarios.
Resumo:
Recently, the Hamilton-Jacobi formulation for first-order constrained systems has been developed. In such formalism the equations of motion are written as total differential equations in many variables. We generalize the Hamilton-Jacobi formulation for singular systems with second-order Lagrangians and apply this new formulation to Podolsky electrodynamics, comparing with the results obtained through Dirac's method.