A new Quasi-Static Energy Recovery Logic family (QSERL) using the principle of adiabatic switching is proposed in this paper. Most of the previously proposed adiabatic logic are dynamic and require complex clocking schemes. The proposed Quasi-Static energy recovery logic uses two complementary sinusoidal supply clocks and resembles behaviors of static CMOS. Thus, switching activity is signiican...

In this paper, d-dimensional (dD) quasi-periodically forced nonlinear Schrödinger equation with a general nonlinearity iut −∆u+Mξu+ εφ(t)(u+ h(|u| 2)u) = 0, x ∈ T, t ∈ R under periodic boundary conditions is studied, where Mξ is a real Fourier multiplier and ε is a small positive parameter, φ(t) is a real analytic quasi-periodic function in t with frequency vector ω = (ω1,ω2 . . . ,ωm), and h(|...

We introduce two three-field mixed formulations for the Poisson equation and propose finite element methods for their approximation. Both mixed formulations are obtained by introducing a weak equation for the gradient of the solution by means of a Lagrange multiplier space. Two efficient numerical schemes are proposed based on using a pair of bases for the gradient of the solution and the Lagra...

We will construct a Quillen model structure out of the multiplier ideal sheaves on a smooth quasi-projective variety using earlier works of Isaksen and Barnea and Schlank. We also show that fibrant objects of this model category are made of kawamata log terminal pairs in birational geometry.

Quasi-linear parabolic equations are discretised in time by fully implicit backward difference formulae (BDF) as well as by implicit–explicit and linearly implicit BDF methods up to order 5. Under appropriate stability conditions for the various methods considered, we establish optimal order a priori error bounds by energy estimates, which become applicable via the Nevanlinna-Odeh multiplier te...

We introduce and analyze a Nitsche-based domain decomposition method for the solution of hypersingular integral equations. This method allows for discretizations with non-matching grids without the necessity of a Lagrangian multiplier, as opposed to the traditional mortar method. We prove its almost quasi-optimal convergence and underline the theory by a numerical experiment.

The quasi-Newton strategy presented in this paper preserves one of the most important features of the stabilized Sequential Quadratic Programming method, the local convergence without constraint qualifications assumptions. It is known that the primal-dual sequence converges quadratically assuming only the second-order sufficient condition. In this work, we show that if the matrices are updated ...

We analyze the perturbations of quasi-solutions to a parameterized nonlinear programming problem, these being feasible solutions accompanied by a Lagrange multiplier vector such that the Karush-Kuhn-Tucker optimality conditions are satisfied. We show under a standard constraint qualification, not requiring uniqueness of the multipliers, that the quasi-solution mapping is differentiable in a gen...

In one variable, the theory of H(b) spaces splits into two streams, one for b which are extreme points of the unit ball of H∞(D), and the other for non-extreme points. We show that there is an analogous splitting in the Drury-Arveson case, between the quasi-extreme and non-quasiextreme cases. (In one variable the notions of extreme and quasi-extreme coincide.) We give a number of equivalent cha...