Search

In many wavelets applications, a scalar product of given function with the scaling function has to be calculated. For deriving effective one point quadrature formulas, the relation among the first scaling moment and the second one is crucial. In this paper, new relations among scaling moments are deduced. [ABSTRACT FROM AUTHOR]

This paper deals with the numerical solution of optimal control problems for ODEs. The methods considered here rely on some standard optimization code to solve a discretized version of the control problem under consideration. We aim to make available to the optimization software not only the discrete objective functional, but also its gradient. The objective gradient can be computed either from forward (sensitivity) information or backward (adjoint) information. The purpose of this paper is to discuss various ways of adjoint computation. It will be shown both theoretically and numerically that methods based on the continuous adjoint equation require a careful choice of both the integrator and gradient assembly formulas in order to obtain a gradient consistent with the discretized control problem. Particular attention is given to automatic differentiation techniques which generate automatically a suitable integrator. [ABSTRACT FROM AUTHOR]

For the problem of minimizing the sum of Euclidean norms (MSN), most existing quadratically convergent algorithms require a strict complementarity assumption. However, this assumption is not satisfied for a number of MSN problems. In this paper, we present a globally and quadratically convergent algorithm for the MSN problem. In particular, the quadratic convergence result is obtained without assuming strict complementarity. Examples without strictly complementary solutions are given to show that our algorithm can indeed achieve quadratic convergence. Preliminary numerical results are reported. [ABSTRACT FROM AUTHOR]

In this paper, we study option pricing under a regime-switching exponential Lévy model. Assuming that the coefficients are time-dependent and modulated by a finite state Markov chain, we generalise the work in Momeya and Morales (Method Comput Appl Probab, 2014, doi:), and Siu and Yang (Acta Mathe Appl Sin 2:369-388, 2009), that is, we use a pricing method based on the Esscher transform conditional on the information available on the Markov chain. We also carry out numerical analysis, to show the impact of the risk induced by the underlying Markov chain on the price of the option. [ABSTRACT FROM AUTHOR]

We present in this paper numerical simulations of reactive flows interacting with shock waves. We argue that spectral methods are suitable for these problems and review the recent developments in spectral methods that have made them a powerful numerical tool appropriate for long-term integrations of complicated flows, even in the presence of shock waves. A spectral code is described in detail, and the theory that leads to each of its components is explained. Results of interactions of hydrogen jets with shock waves are presented and analyzed, and comparisons with ENO finite difference schemes are carried out. [ABSTRACT FROM AUTHOR]

Families of matrices smoothly depending on a vector of parameters are considered. Arnold [Russian Math. Surveys, 26 (1971), pp. 29–43] and Galin [Uspekhi Mat. Nauk, 27 (1972),pp. 241–242] have found and listed normal forms of families of complex and real matrices (miniversal deformations), to which any family of matrices can be transformed in the vicinity of a point in the parameter space by a change of basis, smoothly dependent on a vector of parameters, and by a smooth change of parameters. In this paper a constructive method of determining functions describing a change of basis and a change of parameters, transforming an arbitrary family to the miniversal deformation, is suggested. Derivatives of these functions with respect to parameters are determined from a recurrent procedure using derivatives of the functions of lower orders and derivatives of the family of matrices. Then the functions are found as Taylor series. Examples are given. The suggested method allows using efficiently miniversal deformations for investigation of different properties of matrix families. This is shown in the paper where tangent cones (linear approximations) to the stability domain at the singular boundary points are found. [ABSTRACT FROM AUTHOR]

This paper gives a quantitative result that if A is a substochastic matrix and has r eigenvalues which are sufficiently close to 1, then A has r disjoint principal submatrices which are nearly stochastic. [ABSTRACT FROM AUTHOR]

This paper develops a least-squares approach to the solution of the incompressible Navier­Stokes equations in primitive variables. As with our earlier work on Stokes equations, we recast the Navier­Stokes equations as a first-order system by introducing a velocity-flux variable and associated curl and trace equations. We show that a least-squares principle based on L2 norms applied to this system yields optimal discretization error estimates in the H1 norm in each variable, including the velocity flux. An analogous principle based on the use of an H-1 norm for the reduced system (with no curl or trace constraints) is shown to yield similar estimates, but now in the L2 norm for velocity-flux and pressure. Although the H-1 least-squares principle does not allow practical implementation, these results are critical to the analysis of a practical least-squares method for the reduced system based on a discrete equivalent of the negative norm. A practical method of this type is the subject of a companion paper. Finally, we establish optimal multigrid convergence estimates for the algebraic system resulting from the L2 norm approach. [ABSTRACT FROM AUTHOR]

Mesh matching is an effective way to convert the non-conforming interfaces between two hexahedral meshes into conforming ones, which is very important for achieving high-quality finite element analysis. However, the existing mesh matching algorithm is neither efficient nor effective enough to handle complex interfaces and self-intersecting sheets. In this paper, the algorithm is improved in three aspects: (1) by introducing a more precise criteria for chord matching and the concept of partition chord set, complex interfaces with internal loops can be handled more effectively; (2) by proposing a new solution, self-intersecting sheet can be inflated and extracted locally; and (3) by putting forward a mesh quality evaluation method, the sheet extraction operation during mesh matching can be done more efficiently. Our improved mesh matching algorithm is fully automatic, and its effectiveness is demonstrated by several examples in different matching situations. [ABSTRACT FROM AUTHOR]

This paper improves the inequalities for deviation of a density of the fractional part of the s-dimensional Gaussian random vector from 1 (uniform distribution density) obtained in part I [Theory Probab. Appl., 48 (2004), pp. 355-359]. [ABSTRACT FROM AUTHOR]

This paper presents a method for carrying out the calculus of the risk priority of failures in Failure Mode and Effect Analysis (FMEA). The novelty of the method consists of new management of data provided by the design team, normally given on qualitative scales, without necessitating an arbitrary and artificial numerical conversion. The practical effects of these issues are shown in an application example. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we apply a complete pivoting strategy to compute the left-looking version of AINV preconditioner for linear systems. As the preprocessing, the MultiLevel Nested Dissection reordering has also been applied. We have used this preconditioner as the right preconditioner for several linear systems where the coefficient matrices have been downloaded from the University of Florida Sparse Matrix Collection. Numerical experiments presented in this paper indicate the effectiveness of such a complete pivoting on the quality of left-looking version of AINV preconditioner. [Copyright &y& Elsevier]

In this paper we obtain sufficient conditions for the asymptotic properties of solutions of two dimensional neutral difference systems. Our result extends some existing results in the literature. An example is given to illustrate the result. [ABSTRACT FROM AUTHOR]

In this paper, we study the existence of analytic invariant curves of an iterative equationwhich is from Pielou's equation. By reducing the equation with the Schröder transformation to an auxiliary equation, the author discusses not only that the constantat resonance, i.e. at a root of the unity, but also thosenear resonance under the Brjuno condition. [ABSTRACT FROM AUTHOR]

In this paper, we give a review on rigorous and numerical results for amplitude equations. We focus on the Swift-Hohenberg equation and the Burgers' equation in order to determine the quality of the approximation and the impact of degenerate noise on the approximating equation. [ABSTRACT FROM AUTHOR]

In this correspondence, we point out an error in equation (4) in the above paper. We also correct equation (4) by a detailed mathematical deduction. [ABSTRACT FROM AUTHOR]

In this paper, from the viewpoint of quandle construction we prove that for any link type L and any diagram of it, there exists another diagram of L such that these two diagrams are Ω1-dependent, Ω2-dependent and Ω3-dependent. [ABSTRACT FROM AUTHOR]

In the present paper we generalize the concept of groups with triality and apply it to the theory of the Moufang, Bol and Bruck loops. Such generalizations allow us to reduce certain problems from the loop theory to problems in the theory of groups. [ABSTRACT FROM AUTHOR]

Abstract Given a finite group G , we say that G has property P n if for every prime integer p , G has at most n − 1 irreducible characters whose degrees are multiples of p. In this paper, we classify all finite groups that have property P 4. We show that the groups satisfying property P 4 are exactly the finite groups with at most three nonlinear irreducible characters, one solvable group of order 168, SL 2 (3) , A 5 , S 5 , PSL 2 (7) and A 6. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to introduce and study generalized hyperconnected spaces. Various characterizations of generalized hyperconnected spaces and preservation theorems are discussed. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we use the exp-function method to construct some new soliton solutions of the Benjamin–Bona–Mahony and modified Benjamin–Bona–Mahony equations. These equations have important and fundamental applications in mathematical physics and engineering sciences. The exp-function method is used to find the soliton solution of a wide class of nonlinear evolution equations with symbolic computation. This method provides the concise and straightforward solution in a very easier way. The results obtained in this paper can be viewed as a refinement and improvement of the previously known results. [Copyright &y& Elsevier]

Abstract: This paper investigates the problem of chaos and hyper-chaos control, and proposes a simple adaptive feedback control method for chaos control under a reasonable assumption. In comparison with previous methods, the present control technique is simple both in the form of the controller and its application. Several illustrative examples with numerical simulations are studied by using the results obtained in this paper. Study of examples shows that our control method works very well in chaos control. [Copyright &y& Elsevier]

This paper studies an extension of biorders that has a 'frontier' between the relation and the absence of relation. This extension is motivated by a conjoint measurement problem consisting in the additive representation of ordered coverings defined on product sets of two components. We also investigate interval orders and semiorders with frontier. [ABSTRACT FROM AUTHOR]

In this paper several methods for finding the roots of a polynomial simultaneously are revised, together with a general method for proving their convergence. The theorem used states a lower bound of the convergence order, too. The conditions of this theorem may be easily verified using a Computer Algebra System, like Mathematica. The verification is carried out on a particular polynomial. [ABSTRACT FROM AUTHOR]

This paper presents a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both Finite and Infinite Procedures, characterized by suitable descent directions. [ABSTRACT FROM AUTHOR]

In this paper, we deal with commutative algebras A satisfying the identity 2β{(xy)2 - x2y2} + γ{((xy)x)y + ((xy)y)x - (y2x)x - (x2y)y} = 0, where β, γ are scalars. These algebras appeared as one of the four families of degree four identities in Carini, Hentzel and Piacentini-Cattaneo [2]. We prove that if the algebra A admits an identity element, then A is associative. We also prove that there exist trace forms on A. Finally, we prove that if A has a non-degenerate trace form, then A satisfies the identity ((yx)x)x = y((xx)x), a generalization of right alternativity. Our results require characteristic ≠ 2, 3. [ABSTRACT FROM AUTHOR]

In elliptic curve cryptosystems, scalar multiplications performed on the curves have much effect on the efficiency of the schemes, and many efficient methods have been proposed. In particular, recoding methods of the scalars play an important role in the performance of the algorithm used. For integer radices, the non-adjacent form (NAF) and its generalizations (e.g., the generalized non-adjacent form (GNAF) and the radix- r non-adjacent form ( rNAF)) have been proposed for minimizing the non-zero densities in the representations of the scalars. On the other hand, for subfield elliptic curves, the Frobenius expansions of the scalars can be used for improving efficiency. Unfortunately, there are only a few methods apply the techniques of NAF or its analogue to the Frobenius expansion, namely τ-adic NAF techniques on Koblitz curves and hyperelliptic Koblitz curves. In this paper, we try to combine these techniques, namely recoding methods for reducing non-zero density and the Frobenius expansion, and propose two new efficient recoding methods of scalars on more general family of subfield elliptic curves in odd characteristic. We also prove that the non-zero densities for the new methods are same as those for the original GNAF and rNAF. We estimate scalar multiplication costs on the above subfield elliptic curves in terms of elliptic curve operations and finite field operations for several previous methods and the proposed methods. In addition, we implement scalar multiplication on an subfield elliptic curve belonging to the above family, for the previous methods and a proposed method. As a result, our estimation and implementation show that the speed of the proposed methods improve between 8% and 50% over that for the Frobenius expansion method. [ABSTRACT FROM AUTHOR]

The Fermat-Torricelli problem is an optimization problem associated with a finite subset $\{a_{j}\}_{j=1}^{q}$ of ℝ and a family $\{c_{j}\}_{j=1}^{q}$ of positive weights. The function F to be minimized is defined by $F(x)=\sum _{j=1}^{q}c_{j}\Vert x-a_{j}\Vert$. In this paper, we extend this problem to the case of volumes. [ABSTRACT FROM AUTHOR]

Recently an adaptive nonconforming finite element method (ANFEM) has been developed by Carstensen and Hoppe (in Numer Math 103:251–266, 2006). In this paper, we extend the result to some nonsymmetric and indefinite problems. The main tools in our analysis are a posteriori error estimators and a quasi-orthogonality property. In this case, we need to overcome two main difficulties: one stems from the nonconformity of the finite element space, the other is how to handle the effect of a nonsymmetric and indefinite bilinear form. An appropriate adaptive nonconforming finite element method featuring a marking strategy based on the comparison of the a posteriori error estimator and a volume term is proposed for the lowest order Crouzeix–Raviart element. It is shown that the ANFEM is a contraction for the sum of the energy error and a scaled volume term between two consecutive adaptive loops. Moreover, quasi-optimality in the sense of quasi-optimal algorithmic complexity can be shown for the ANFEM. The results of numerical experiments confirm the theoretical findings. [ABSTRACT FROM AUTHOR]

A strong indication about the existence of a (7 p, 4, 1) difference family with p ≡ 7 (mod 12) a prime has been given in [11]. Here, developing some ideas of that paper, we give, much more generally, a strong indication about the existence of a cyclic ( pq, 4, 1) difference family whenever p and q are primes congruent to 7 (mod 12) and of a cyclic ( pq, 5, 1) difference family whenever p and q are primes congruent to 11 (mod 20). Indeed we give an algorithm for their construction that seems to be always successful and we have checked it works whenever both primes p and q do not exceed 1,000. All our ( pq, 4, 1) and ( pq, 5, 1) difference families have the nice property of admitting a multiplier of order 3 or 5, respectively, that fixes almost all base blocks. As an intermediate result we also find an optimal ( p, 5, 1) optical orthogonal code for every prime p ≡ 11 (mod 20) not exceeding 10,000. [ABSTRACT FROM AUTHOR]

The paper investigates the inclusion intervals of matrix singular values. By employing the digraph of a matrix, some new inclusion intervals of matrix singular values are presented. These intervals are based mainly on the use of positive scale vectors and their intersections. Theoretic analysis and numerical examples show that these results improve and generalize some known results of Li et al. (Numer. Linear Algebra Appl. 2007; 14(2):115–128) and Kolotilina (J. Math. Sci. 2006; 137(3):4794–4800). Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. [ABSTRACT FROM AUTHOR]

This paper presents a new method to isolate all configurations that a multiloop linkage can adopt. The problem is tackled by means of formulation and resolution techniques that fit particularly well together. The adopted formulation yields a system of simple equations (only containing linear, bilinear, and quadratic monomials, and trivial trigonometric terms for the helical pair only) whose structure is later exploited by a branch-and-prune method based on linear relaxations. The method is general, as it can be applied to linkages with single or multiple loops with arbitrary topology, involving lower pairs of any kind, and complete, as all possible solutions get accurately bounded, irrespective of whether the linkage is rigid or mobile. [ABSTRACT FROM AUTHOR]

The purpose of the paper is to determine fine spectrum of newly introduced operator Δν on the sequence space c0. The operator Δν on c0 is defined by Δνχ = (νnχn - νn-1χn-1)n=0∞ with χ-1 = 0, where ν = (νk) is either constant or strictly decreasing sequence of positive real numbers such that lim νk = L > 0 and sup νk ≤ 2L. In this paper, it is shown that spectrum (These equations cannot be represented into ASCII text), the point spectrum σp(Δν,c0) = ϕ if ν is a constant and σp(Δν,c0) = {νn} if ν is a strictly decreasing sequence. We have also obtained the results on continuous spectrum σc(Δν,c0), residual spectrum σr(Δν,c0) and fine spectrum of the operator Δν on c0. [ABSTRACT FROM AUTHOR]

Using the fixed point index, we study positive solutions of the multi-point fourth-order nonlinear boundary value problem u(4)(t) = λf (u(t)); 0 < t < 1, u(2i+1)(0) = 0, αiu(2i)(ηi) = u(2i)(1), i = 0,1, where (These equations cannot be represented into ASCII text). The intervals for the parameter λ are obtained for which the existence of at least one solution is guaranteed. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to provide a simple relation between the Witten-Reshetikhin-Turaev SO (3) invariant and the Hennings invariant associated to quantum - $\fsl2$. [ABSTRACT FROM AUTHOR]

This paper deals with superconvergence phenomena in general grids when projectionbased approximations are used for solving Fredholm integral equations of the second kind with weakly singular kernels. Four variants of the Galerkin method are considered. They are the classical Galerkin method, the iterated Galerkin method, the Kantorovich method, and the iterated Kantorovich method. It is proved that the iterated Kantorovich approximation exhibits the best superconvergence rate if the right-hand side of the integral equation is nonsmooth. All error estimates are derived for an arbitrary grid without any uniformity or quasi-uniformity condition on it, and are formulated in terms of the data without any additional assumption on the solution. Numerical examples concern the equation governing transfer of photons in stellar atmospheres. The numerical results illustrate the fact that the error estimates proposed in the different theorems are quite sharp, and confirm the superiority of the iterated Kantorovich scheme. [ABSTRACT FROM AUTHOR]

A recent study [D. N. Arnold, D. Boffi, and R. S. Falk, SIAM J. Numer. Anal., 42 (2005), pp. 2429-2451] reveals that convergence of finite element methods using H(div , O)-compatible finite element spaces deteriorates on nonaffine quadrilateral grids. This phenomena is particularly troublesome for the lowest-order Raviart-Thomas elements, because it implies loss of convergence in some norms for finite element solutions of mixed and least-squares methods. In this paper we propose reformulation of finite element methods, based on the natural mimetic divergence operator [M. Shashkov, Conservative Finite Difference Methods on General Grids, CRC Press, Boca Raton, FL, 1996], which restores the order of convergence. Reformulations of mixed Galerkin and leastsquares methods for the Darcy equation illustrate our approach. We prove that reformulated methods converge optimally with respect to a norm involving the mimetic divergence operator. Furthermore, we prove that standard and reformulated versions of the mixed Galerkin method lead to identical linear systems, but the two versions of the least-squares method are veritably different. The surprising conclusion is that the degradation of convergence in the mixed method on nonaffine quadrilateral grids is superficial, and that the lowest-order Raviart-Thomas elements are safe to use in this method. However, the breakdown in the least-squares method is real, and there one should use our proposed reformulation. [ABSTRACT FROM AUTHOR]

We develop a family of new interior penalty discontinuous Galerkin methods for the Keller-Segel chemotaxis model. This model is described by a system of two nonlinear PDEs: a convection-diffusion equation for the cell density coupled with a reaction-diffusion equation for the chemoattractant concentration. It has been recently shown that the convective part of this system is of a mixed hyperbolic-elliptic-type, which may cause severe instabilities when the studied system is solved by straightforward numerical methods. Therefore, the first step in the derivation of our new methods is made by introducing the new variable for the gradient of the chemoattractant concentration and by reformulating the original Keller-Segel model in the form of a convection-diffusionreaction system with a hyperbolic convective part. We then design interior penalty discontinuous Galerkin methods for the rewritten Keller-Segel system. Our methods employ the central-upwind numerical fluxes, originally developed in the context of finite-volume methods for hyperbolic systems of conservation laws. In this paper, we consider Cartesian grids and prove error estimates for the proposed high-order discontinuous Galerkin methods. Our proof is valid for pre-blow-up times since we assume boundedness of the exact solution. We also show that the blow-up time of the exact solution is bounded from above by the blow-up time of our numerical solution. In the numerical tests presented below, we demonstrate that the obtained numerical solutions have no negative values and are oscillation-free, even though no slope-limiting technique has been implemented. [ABSTRACT FROM AUTHOR]

In a paper by J. V. Pereira and the author it was proved that any pencil of plane curves of degree $d>1$ with irreducible generic fiber can have at most five completely reducible fibers although no examples with five such fibers had ever been found. Recently Janis Stipins has proved that if a pencil has a base of $d^2$ points, then it cannot have five completely reducible fibers. In this paper we generalize Stipins' result to arbitrary pencils. We also include into consideration more general special fibers that are the unions of lines and non-reduced curves. These fibers are important for characteristic varieties of hyperplane complements. [ABSTRACT FROM AUTHOR]

Judy and Motta developed a customizable electrodeposition process for fabrication of very small metal structures on a substrate. In this process, layers of metal of various shapes are placed on the substrate, then the substrate is inserted in an electroplating solution. Some of the metal layers have power applied to them, while the rest of the metal layers are not connected to the power initially. Metal ions in the plating solution start depositing on the powered layers and a surface grows from the powered layers. As the surface grows, it will touch metal layers that were initially unpowered, causing them to become powered and to start growing with the rest of the surface. The metal layers on the substrate are known as seed layer patterns, and different seed layer patterns can produce different shapes. This paper presents a mathematical model, a forward simulation method, and an inverse problem solution for the growth of a surface from a seed layer pattern. The model describes the surface evolution as uniform growth in the direction normal to the surface. This growth is simulated in two and three dimensions using the level set method. The inverse problem is to design a seed layer pattern that produces a desired surface shape. Some surface shapes are not attainable by any seed layer pattern. For smooth attainable shapes, we present a computational method that solves this inverse problem. [ABSTRACT FROM AUTHOR]

In this paper, based on Patel's algorithm (1993), we propose a structure-preserving algorithm for solving palindromic quadratic eigenvalue problems (QEPs). We also show the relationship between the structure-preserving algorithm and the URV-based structure-preserving algorithm by Schröder (2007). For large sparse palindromic QEPs, we develop a generalized T-skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi algorithm for solving the resulting T-skew-Hamiltonian pencils. Numerical experiments show that our proposed structure-preserving algorithms perform well on the palindromic QEP arising from a finite element model of high-speed trains and rails. [ABSTRACT FROM AUTHOR]

In this paper we analyze the numerical behavior of several minimum residual methods which are mathematically equivalent to the GMRES method. Two main approaches are compared: one that computes the approximate solution in terms of a Krylov space basis from an upper triangular linear system for the coordinates, and one where the approximate solutions are updated with a simple recursion formula. We show that a different choice of the basis can significantly influence the numerical behavior of the resulting implementation. While Simpler GMRES and ORTHODIR are less stable due to the ill-conditioning of the basis used, the residual basis is well-conditioned as long as we have a reasonable residual norm decrease. These results lead to a new implementation, which is conditionally backward stable, and they explain the experimentally observed fact that the GCR method delivers very accurate approximate solutions when it converges fast enough without stagnation. [ABSTRACT FROM AUTHOR]

Scaling is a commonly used technique for standard eigenvalue problems to improve the sensitivity of the eigenvalues. In this paper we investigate scaling for generalized and polynomial eigenvalue problems (PEPs) of arbitrary degree. It is shown that an optimal diagonal scaling of a PEP with respect to an eigenvalue can be described by the ratio of its normwise and componentwise condition number. Furthermore, the effect of linearization on optimally scaled polynomials is investigated. We introduce a generalization of the diagonal scaling by Lemonnier and Van Dooren to PEPs that is especially effective if some information about the magnitude of the wanted eigenvalues is available and also discuss variable transformations of the type λ = αμ for PEPs of arbitrary degree. [ABSTRACT FROM AUTHOR]

This paper studies robust stability of linear systems with polytopic uncertainty. New necessary and sufficient conditions for the existence of an affine parameter-dependent Lyapunov function assuring the Hurwitz or the Schur stability of a polytopic system are presented. These conditions are composed of a family of linear matrix inequality conditions of increasing precision. At each step, a set of linear matrix inequalities provides sufficient conditions for the existence of the affine parameter-dependent Lyapunov function, and necessity is asymptotically attained. Compared with the existing results in the literature, it is shown that the new stability conditions provide less conservative tests at each step. Numerical examples are given to illustrate the effectiveness of the new results. [ABSTRACT FROM AUTHOR]

It is becoming increasingly apparent that probabilistic approaches can overcome conservatism and computational complexity of the classical worst-case deterministic framework and may lead to designs that are actually safer. In this paper we argue that a comprehensive probabilistic robustness analysis requires a detailed evaluation of the robustness function, and we show that such an evaluation can be performed with essentially any desired accuracy and confidence using algorithms with complexity that is linear in the dimension of the uncertainty space. Moreover, we show that the average memory requirements of such algorithms are absolutely bounded and well within the capabilities of today's computers. In addition to efficiency, our approach permits control over statistical sampling error and the error due to discretization of the uncertainty radius. For a specific level of tolerance of the discretization error, our techniques provide an efficiency improvement upon conventional methods which is inversely proportional to the accuracy level; i.e., our algorithms get better as the demands for accuracy increase. [ABSTRACT FROM AUTHOR]

Disjoint $\mathsf{NP}$ -pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint $\mathsf{NP}$ -pairs to disjoint k-tuples of $\mathsf{NP}$ -sets for k≥2. We define subclasses of the class of all disjoint k-tuples of $\mathsf{NP}$ -sets. These subclasses are associated with a propositional proof system and possess complete tuples which are defined from the proof system. In our main result we show that complete disjoint $\mathsf{NP}$ -pairs exist if and only if complete disjoint k-tuples of $\mathsf{NP}$ -sets exist for all k≥2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all k-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof systems. [ABSTRACT FROM AUTHOR]