This paper addresses logarithmic quantizers with dynamic sensitivity design for continuous-time linear systems with a quantized feedback control law. The dynamics of state quantization and control quantization sensitivities during “zoom-in”/“zoom-out” stages are proposed. Dwell times of the dynamic sensitivities are co-designed. It is shown that with the proposed algorithm, a single-input continuous-time linear system can be stabilized by quantized feedback control via adopting sensitivity varying algorithm under certain assumptions. Also, the advantage of logarithmic quantization is sustained while achieving stability. Simulation results are provided to verify the theoretical analysis.

We show that the space $G^r_{\underline d}(X)$ of linear series of certain multi-degree $\underline d=(d_1,d_2)$ (including the balanced ones) and rank r on a general genus-g binary curve X has dimension $\rho _{g,r,d}=g-(r+1)(g-d+r)$ if nonempty, where $d=d_1+d_2$ . This generalizes Caporaso’s result from the case $r\leq 2$ to arbitrary rank, and shows that the space of Osserman-limit linear series on a general binary curve has the expected dimension, which was known for $r\leq 2$ . In addition, we show that the space $G^r_{\underline d}(X)$ is still of expected dimension after imposing certain ramification conditions with respect to a sequence of increasing effective divisors supported on two general points $P_i\in Z_i$ , where $i=1,2$ and $Z_1,Z_2$ are the two components of X. Our result also has potential application to the lifting problem of divisors on graphs to divisors on algebraic curves.

We propose here a generalization of the problem addressed by the SHGH conjecture. The SHGH conjecture posits a solution to the question of how many conditions a general union $X$ of fat points imposes on the complete linear system of curves in $\mathbb{P}^{2}$ of fixed degree $d$, in terms of the occurrence of certain rational curves in the base locus of the linear subsystem defined by $X$. As a first step towards a new theory, we show that rational curves play a similar role in a special case of a generalized problem, which asks how many conditions are imposed by a general union of fat points on linear subsystems defined by imposed base points. Moreover, motivated by work of Di Gennaro, Ilardi and Vallès and of Faenzi and Vallès, we relate our results to the failure of a strong Lefschetz property, and we give a Lefschetz-like criterion for Terao’s conjecture on the freeness of line arrangements.

Subspace projection methods based on the Krylov subspace using powers of a matrix A have often been standard for solving large matrix computations in many areas of application. Recently, projection methods based on the extended Krylov subspace using powers of A and A−1 have attracted attention, particularly for functions of a matrix times a vector and matrix equations. In this article, we propose an efficient algorithm for constructing an orthonormal basis for the extended Krylov subspace. Numerical experiments indicate that this algorithm has less computational cost and approximately the same accuracy as the traditional algorithm.

With the aid of index functions, we re-derive the ML(n)BiCGStab algorithm in [Yeung and Chan, SIAM J. Sci. Comput., 21 (1999), pp. 1263-1290] systematically. There are n ways to define the ML(n)BiCGStab residual vector. Each definition leads to a different ML(n)BiCGStab algorithm. We demonstrate this by presenting a second algorithm which requires less storage. In theory, this second algorithm serves as a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based FOM while ML(n)BiCG is a bridge connecting BiCG and FOM. We also analyze the breakdown situation from the probabilistic point of view and summarize some useful properties of ML(n)BiCGStab. Implementation issues are also addressed.

A control system is said to be finite if the Lie algebra generated by its vector fieldsis finite dimensional. Sufficient conditions for such a system on a compact manifold to becontrollable are stated in terms of its Lie algebra. The proofs make use of theequivalence theorem of [Ph. Jouan, ESAIM: COCV 16 (2010)956–973]. and of the existence of an invariant measure on certain compact homogeneousspaces.

The aim of this paper is to prove that a control affine system on a manifold is equivalent by diffeomorphismto a linear system on a Lie group or a homogeneous space if and only if the vectorfields of the system are complete and generate a finite dimensionalLie algebra.

A vector field on a connected Lie group is linear if its flow is a one parametergroup of automorphisms. An affine vector field is obtained by adding aleft invariant one. Its projection on a homogeneous space, whenever it exists, is still called affine.

Affine vector fields on homogeneous spaces can be characterized by their Lie brackets withthe projections of right invariant vector fields.

A linear system on a homogeneous space is a system whose drift part isaffine and whose controlled part is invariant.

The main result is based on a general theorem on finite dimensional algebras generated by complete vector fields, closely related to a theorem of Palais, and which has its own interest. The present proof makes use of geometric control theory arguments.

Contrast sensitivity is a measure of the ability of an observer to detect contrast signals of particular spatial and temporal frequencies. A formal definition of contrast sensitivity that can be applied to individual linear visual neurons is derived. A neuron is modeled by a contrast transfer function and its modulus, contrast gain, and by a noise power spectrum. The distributions of neural responses to signal and blank presentations are derived, and from these, a definition of contrast sensitivity is obtained. This formal definition may be used to relate the sensitivities of various populations of neurons, and to relate the sensitivities of neurons to that of the behaving animal.

Nonlinear couplings between the various joints of a robotic arm cause trouble in robot control. One possibility to overcome these difficulties is offered by the concept of nonlinear decoupling. The latter leads to independent linear SISO systems, each of them describing the movement of one joint. Thus, an application of control concepts for linear SISO systems is possible. However, at present such decoupling controls are computed from the mathematical model of the arm, the so-called drive equations, whereas actuator dynamics are considered only in a secondary way. In this paper the decoupling problem for robots is investigated by accounting also for the actuator dynamics from the very beginning. This results in decoupling laws requiring a complete state feedback, i.e. not only joint positions and velocities but also the states of the various actuators have to be used. Further, formulas are given which make the computation of those states unsuitable for direct measurements.

We present relations between cycles with rational coefficients modulo algebraic equivalence on the Jacobian of a curve. These relations depend on the linear systems that the curve admits. They are obtained in the tautological ring, the smallest subspace containing (an embedding of) the curve and closed under the basic operations of intersection, Pontryagin product and the pullback and pushdown induced by homotheties.

Using the $\sharp$-minimal model program of uniruled varieties we show that, for any pair $(X, {\mathcal H})$ consisting of a reduced and irreducible variety $X$ of dimension $k \geq 3$ and a globally generated big line bundle ${\mathcal H}$ on $X$ with $d:= {\mathcal H}^k$ and $n:= h^0(X, {\mathcal H})-1$ such that $d<2(n-k)-4$, then $X$ is uniruled of ${\mathcal H}$-degree one, except if $(k,d,n)=(3,27,19)$ and a ${\sharp}$-minimal model of $(X, {\mathcal H})$ is $({\mathbb P}^3,{\mathcal O}_{{\mathbb P}^3}(3))$. We also show that the bound is optimal for threefolds.

Bertini's theorem on variable singular points may fail in characteristic $p$; there are algebraic fibrations that are pathological in the sense that all fibres are non-smooth though the total space admits only a finite number of singular points. We prove that if an algebraic fibration by plane projective quartic curves in characteristic 7 is pathological then, after an eventual cyclic base extension of degree 3, it is, up to birational equivalence, obtained by a base extension from the pencil of quartic curves cut out by the equations $ zx^3 + xy^3 + t yz^3 = 0$.

More generally, we classify pathological fibrations by canonical curves of arithmetic genus $g = \frac{p - 1}{2}$ in the projective space of dimension $\frac{p - 3}{2}$. We prove that the gap sequences of the smooth Weierstrass points of the fibres have the property that a positive integer $\ell$ is a gap if and only if $2g + 1 - \ell$ is a non-gap. In analogy to the Kodaira–Néron classification of special fibres of minimal fibrations by elliptic curves, we construct minimal proper regular models of pathological fibrations, determine the structure of the bad fibres, and study the global geometry of the total spaces.

In this paper it is shown that the generalized smoothing spline obtained by solving an optimal control problem for a linear control system converges to a deterministic curve even when the data points are perturbed by random noise. We furthermore show that such a spline acts as a filter for white noise. Examples are constructed that support the practical usefulness of the method as well as gives some hints as to the speed of convergence.