Enhancing the Quantum Linear Systems Algorithm Using Richardson Extrapolation

We present a quantum algorithm to solve systems of linear equations of the form Ax = b , where A is a tridiagonal Toeplitz matrix and b results from discretizing an analytic function, with a circuit complexity of O (1/√ε, poly (log κ, log N )), where N denotes the number of equations, ε is the accuracy, and κ the condition number. The repeat-until-success algorithm has to be run O (κ/(1-ε)) times to succeed, leveraging amplitude amplification, and needs to be sampled O (1/ε 2 ) times. Thus, the algorithm achieves an exponential improvement with respect to N over classical methods. In particular, we present efficient oracles for state preparation, Hamiltonian simulation, and a set of observables together with the corresponding error and complexity analyses. As the main result of this work, we show how to use Richardson extrapolation to enhance Hamiltonian simulation, resulting in an implementation of Quantum Phase Estimation (QPE) within the algorithm with 1/√ε circuits that can be run in parallel each with circuit complexity 1/√ ε instead of 1/ε. Furthermore, we analyze necessary conditions for the overall algorithm to achieve an exponential speedup compared to classical methods. Our approach is not limited to the considered setting and can be applied to more general problems where Hamiltonian simulation is approximated via product formulae, although our theoretical results would need to be extended accordingly. All the procedures presented are implemented with Qiskit and tested for small systems using classical simulation as well as using real quantum devices available through the IBM Quantum Experience.

Design and analysis of a faster King-Werner-type derivative free method

We introduce a new faster King-Werner-type derivative-free method for solving nonlinear equations. The local as well as semi-local convergence analysis is presented under weak center Lipschitz and Lipschitz conditions. The convergence order as well as the convergence radii are also provided. The radii are compared to the corresponding ones from similar methods. Numerical examples further validate the theoretical results.

Load-balancing for multi-skilled servers with Bernoulli routing

We study the optimal Bernoulli routing in a multiclass queueing system with a dedicated server for each class as well as a common (or multi-skilled) server that can serve jobs of all classes. Jobs of each class arrive according to a Poisson process. Each server has a holding cost per customer and use the processor sharing discipline for service. The objective is to minimize the weighted mean holding cost. First, we provide conditions under which classes send their traffic only to their dedicated server, only to the common server, or to both. A fixed point algorithm is given for the computation of the optimal solution. We then specialize to two classes and give explicit expressions for the optimal loads. Finally, we compare the cost of multi-skilled server with that of only dedicated or all common servers. The theoretical results are complemented by numerical examples that illustrate the various structural results as well as the convergence of the fixed point algorithm.

On the Semi-Local Convergence of a Traub-Type Method for Solving Equations

The celebrated Traub’s method involving Banach space-defined operators is extended. The main feature in this study involves the determination of a subset of the original domain that also contains the Traub iterates. In the smaller domain, the Lipschitz constants are smaller too. Hence, a finer analysis is developed without the usage of additional conditions. This methodology applies to other methods. The examples justify the theoretical results.

Practical Tracking Control Under Actuator Saturation for a Class of Flexible-Joint Robotic Manipulators Driven by DC Motors

This paper is devoted to the practical tracking control for a class of flexible-joint robotic manipulators driven by DC motors. Different from the related literature where control constraint is neglected and the disturbances are excluded or only exist in one subsystem, actuator saturation is considered in this paper while the disturbances are present in all the three subsystems. This leads to the incapability of the traditional schemes on this topic. For this, a novel control design scheme is proposed by skillfully incorporating adaptive dynamic compensation technique, constructive methods of command filters and an auxiliary system for the actuator saturation into the backstepping framework, and in turn to design a practical tracking controller which ensures that all the states of the resulting closed-loop system are bounded and the system output practically tracks the reference signal. It is worthwhile strengthening that a more wider class of reference signals can be tracked since they are only first order continuously differentiable but twice or more in the related literature. Finally, a numerical example is provided to validate the effectiveness of the proposed theoretical results.

On approximation of Bernstein–Chlodowsky–Gadjiev type operators that fix $e^{-2x}$

Abstractthat fix the function $e^{-2x} $ e − 2 x for $x\geq 0 $ x ≥ 0 . Then, we provide the approximation properties of these newly defined operators for different types of function spaces. In addition, we focus on the rate of convergence utilizing appropriate moduli of continuity. Then, we provide the Voronovskaya-type theorem for these new operators. Finally, in order to validate our theoretical results, we provide some numerical experiments that are produced by a MATLAB complier.

On Global Convergence of Third-Order Chebyshev-Type Method under General Continuity Conditions

There are very few papers that talk about the global convergence of iterative methods with the help of Banach spaces. The main purpose of this paper is to discuss the global convergence of third order iterative method. The convergence analysis of this method is proposed under the assumptions that Fréchet derivative of first order satisfies continuity condition of the Hölder. Finally, we consider some integral equation and boundary value problem (BVP) in order to illustrate the suitability of theoretical results.

Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework

Combinatorial auctions have seen limited applications in large-scale consumer-oriented marketplaces, partly due to the substantial complexity to keep track of auction status and formulate informed bidding strategies. We study the bidder support problem for the general multi-item multi-unit (MIMU) combinatorial auctions, where multiple heterogeneous items are being auctioned and multiple homogeneous units are available for each item. Under two prevalent bidding languages (OR bidding and XOR bidding), we derive theoretical results and design efficient algorithmic procedures to calculate important bidder support information, such as the winning bids of an auction and the minimum bidding value for a bid to win an auction either immediately or potentially in the future. Our results unify the theoretical insights on bidder support problem for different bidding languages as well as different special cases of general MIMU auctions, namely the single-item multi-unit (SIMU) auctions and the multi-item single-unit (MISU) auctions. We also consider auctions with additional bidding constraints, including batch-based combinatorial auctions and hierarchical combinatorial auctions, as well as the combinatorial reverse auctions, all of which have relevant practical applications (e.g., industrial procurements). Our results can be readily extended to solve the bidder support problems in these auction mechanisms.

Bifurcation and Patterns Analysis for a Spatiotemporal Discrete Gierer-Meinhardt System

The Gierer-Meinhardt system is one of the prototypical pattern formation models. The bifurcation and pattern dynamics of a spatiotemporal discrete Gierer-Meinhardt system are investigated via the couple map lattice model (CML) method in this paper. The linear stability of the fixed points to such spatiotemporal discrete system is analyzed by stability theory. By using the bifurcation theory, the center manifold theory and the Turing instability theory, the Turing instability conditions in flip bifurcation and Neimark–Sacker bifurcation are considered, respectively. To illustrate the above theoretical results, numerical simulations are carried out, such as bifurcation diagram, maximum Lyapunov exponents, phase orbits, and pattern formations.

Reliability modeling of three-state systems with multiple types of components

In this paper, a system consisting of three states: perfect functioning, partial functioning, and down is considered. The system is assumed to be composed of several non-identical groups of binary components. The reliability of the system states under various assumptions on the component lifetimes is investigated. For this purpose, first, a new concept of bivariate survival signature (BSS) is introduced. Then, under the assumption that the component lifetimes of each type are exchangeable dependent, representations for the joint reliability function of the state lifetimes are obtained based on the notion of BSS. In the particular case, three-state systems composed of two types of different modules such as general-series (parallel) systems and systems with component-wise redundancy are investigated. Several examples are presented to illustrate the theoretical results.