An analysis of arithmetic averaging in approximate Riemann solvers with an application to steady, supercritical flows

An analysis of various arithmetic averaging procedures for approximate Riemann solvers is made with a specific emphasis on efficiency and a jump capturing property. The various alternatives discussed are intended for future work, as well as the more immediate problem of steady, supercritical free-surface flows. Numerical results are shown for two test problems.

On discrimination algorithms for ill-posed problems with an application to magnetic tomography

In this paper we explore classification techniques for ill-posed problems. Two classes are linearly separable in some Hilbert space X if they can be separated by a hyperplane. We investigate stable separability, i.e. the case where we have a positive distance between two separating hyperplanes. When the data in the space Y is generated by a compact operator A applied to the system states ∈ X, we will show that in general we do not obtain stable separability in Y even if the problem in X is stably separable. In particular, we show this for the case where a nonlinear classification is generated from a non-convergent family of linear classes in X. We apply our results to the problem of quality control of fuel cells where we classify fuel cells according to their efficiency. We can potentially classify a fuel cell using either some external measured magnetic field or some internal current. However we cannot measure the current directly since we cannot access the fuel cell in operation. The first possibility is to apply discrimination techniques directly to the measured magnetic fields. The second approach first reconstructs currents and then carries out the classification on the current distributions. We show that both approaches need regularization and that the regularized classifications are not equivalent in general. Finally, we investigate a widely used linear classification algorithm Fisher's linear discriminant with respect to its ill-posedness when applied to data generated via a compact integral operator. We show that the method cannot stay stable when the number of measurement points becomes large.

Inverse problems in neural field theory

We study inverse problems in neural field theory, i.e., the construction of synaptic weight kernels yielding a prescribed neural field dynamics. We address the issues of existence, uniqueness, and stability of solutions to the inverse problem for the Amari neural field equation as a special case, and prove that these problems are generally ill-posed. In order to construct solutions to the inverse problem, we first recast the Amari equation into a linear perceptron equation in an infinite-dimensional Banach or Hilbert space. In a second step, we construct sets of biorthogonal function systems allowing the approximation of synaptic weight kernels by a generalized Hebbian learning rule. Numerically, this construction is implemented by the Moore–Penrose pseudoinverse method. We demonstrate the instability of these solutions and use the Tikhonov regularization method for stabilization and to prevent numerical overfitting. We illustrate the stable construction of kernels by means of three instructive examples.

Application of complex extreme learning machine to multiclass classification problems with high dimensionality: a THz spectra classification problem

We extend extreme learning machine (ELM) classifiers to complex Reproducing Kernel Hilbert Spaces (RKHS) where the input/output variables as well as the optimization variables are complex-valued. A new family of classifiers, called complex-valued ELM (CELM) suitable for complex-valued multiple-input–multiple-output processing is introduced. In the proposed method, the associated Lagrangian is computed using induced RKHS kernels, adopting a Wirtinger calculus approach formulated as a constrained optimization problem similarly to the conventional ELM classifier formulation. When training the CELM, the Karush–Khun–Tuker (KKT) theorem is used to solve the dual optimization problem that consists of satisfying simultaneously smallest training error as well as smallest norm of output weights criteria. The proposed formulation also addresses aspects of quaternary classification within a Clifford algebra context. For 2D complex-valued inputs, user-defined complex-coupled hyper-planes divide the classifier input space into four partitions. For 3D complex-valued inputs, the formulation generates three pairs of complex-coupled hyper-planes through orthogonal projections. The six hyper-planes then divide the 3D space into eight partitions. It is shown that the CELM problem formulation is equivalent to solving six real-valued ELM tasks, which are induced by projecting the chosen complex kernel across the different user-defined coordinate planes. A classification example of powdered samples on the basis of their terahertz spectral signatures is used to demonstrate the advantages of the CELM classifiers compared to their SVM counterparts. The proposed classifiers retain the advantages of their ELM counterparts, in that they can perform multiclass classification with lower computational complexity than SVM classifiers. Furthermore, because of their ability to perform classification tasks fast, the proposed formulations are of interest to real-time applications.

Strongly damped wave problems: Bootstrapping and regularity of solutions

The aim of the article is to present a unified approach to the existence, uniqueness and regularity of solutions to problems belonging to a class of second order in time semilinear partial differential equations in Banach spaces. Our results are applied next to a number of examples appearing in literature, which fall into the class of strongly damped semilinear wave equations. The present work essentially extends the results on the existence and regularity of solutions to such problems. Previously, these problems have been considered mostly within the Hilbert space setting and with the main part operators being selfadjoint. In this article we present a more general approach, involving sectorial operators in reflexive Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Desenvolvimento de um instrumento portátil para detectar falha em rolamento de motor de indução, pela técnica do envelope, usando um DSP de 16 bits e a transformada de Hilbert

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

RIEMANN ZETA ZEROS AND PRIME NUMBER SPECTRA IN QUANTUM FIELD THEORY

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A note on the hypercomplex riemann-cauchy like relations for quaternions and laplace equations

In this Note it is worked out a new set of Laplace-Like equations for quaternions through Riemann-Cauchy hypercomplex relations otained earlier [1]. As in the theory of functions of a complex variable, it is expected that this new set of Laplace-Like equations might be applied to a large number of Physical problems, providing new insights in the Classical Fields Theory.

Error Upper Bounds for a Computational Method for Nonlinear Boundary and Initial-Value Problems

This work develops a computational approach for boundary and initial-value problems by using operational matrices, in order to run an evolutive process in a Hilbert space. Besides, upper bounds for errors in the solutions and in their derivatives can be estimated providing accuracy measures.

On existence and uniqueness of positive solutions to a class of fractional boundary value problems

[EN] The purpose of this paper is to investigate the existence and uniqueness of positive solutions for the following fractional boundary value problem D 0 + α u ( t ) + f ( t , u ( t ) ) = 0 , 0 < t < 1 , u ( 0 ) = u ( 1 ) = u ′ ( 0 ) = 0 , where 2 < α ≤ 3 and D 0 + α is the Riemann-Liouville fractional derivative. Our analysis relies on a fixed-point theorem in partially ordered metric spaces. The autonomous case of this problem was studied in the paper [Zhao et al., Abs. Appl. Anal., to appear], but in Zhao et al. (to appear), the question of uniqueness of the solution is not treated. We also present some examples where we compare our results with the ones obtained in Zhao et al. (to appear). 2010 Mathematics Subject Classification: 34B15

The factorization method for real elliptic problems

The Factorization Method localizes inclusions inside a body from measurements on its surface. Without a priori knowing the physical parameters inside the inclusions, the points belonging to them can be characterized using the range of an auxiliary operator. The method relies on a range characterization that relates the range of the auxiliary operator to the measurements and is only known for very particular applications. In this work we develop a general framework for the method by considering symmetric and coercive operators between abstract Hilbert spaces. We show that the important range characterization holds if the difference between the inclusions and the background medium satisfies a coerciveness condition which can immediately be translated into a condition on the coefficients of a given real elliptic problem. We demonstrate how several known applications of the Factorization Method are covered by our general results and deduce the range characterization for a new example in linear elasticity.

Statistical problems related to excitation threshold and reset value of membrane potentials

Die vorliegende Arbeit ist motiviert durch biologische Fragestellungen bezüglich des Verhaltens von Membranpotentialen in Neuronen. Ein vielfach betrachtetes Modell für spikende Neuronen ist das Folgende. Zwischen den Spikes verhält sich das Membranpotential wie ein Diffusionsprozess X der durch die SDGL dX_t= beta(X_t) dt+ sigma(X_t) dB_t gegeben ist, wobei (B_t) eine Standard-Brown'sche Bewegung bezeichnet. Spikes erklärt man wie folgt. Sobald das Potential X eine gewisse Exzitationsschwelle S überschreitet entsteht ein Spike. Danach wird das Potential wieder auf einen bestimmten Wert x_0 zurückgesetzt. In Anwendungen ist es manchmal möglich, einen Diffusionsprozess X zwischen den Spikes zu beobachten und die Koeffizienten der SDGL beta() und sigma() zu schätzen. Dennoch ist es nötig, die Schwellen x_0 und S zu bestimmen um das Modell festzulegen. Eine Möglichkeit, dieses Problem anzugehen, ist x_0 und S als Parameter eines statistischen Modells aufzufassen und diese zu schätzen. In der vorliegenden Arbeit werden vier verschiedene Fälle diskutiert, in denen wir jeweils annehmen, dass das Membranpotential X zwischen den Spikes eine Brown'sche Bewegung mit Drift, eine geometrische Brown'sche Bewegung, ein Ornstein-Uhlenbeck Prozess oder ein Cox-Ingersoll-Ross Prozess ist. Darüber hinaus beobachten wir die Zeiten zwischen aufeinander folgenden Spikes, die wir als iid Treffzeiten der Schwelle S von X gestartet in x_0 auffassen. Die ersten beiden Fälle ähneln sich sehr und man kann jeweils den Maximum-Likelihood-Schätzer explizit angeben. Darüber hinaus wird, unter Verwendung der LAN-Theorie, die Optimalität dieser Schätzer gezeigt. In den Fällen OU- und CIR-Prozess wählen wir eine Minimum-Distanz-Methode, die auf dem Vergleich von empirischer und wahrer Laplace-Transformation bezüglich einer Hilbertraumnorm beruht. Wir werden beweisen, dass alle Schätzer stark konsistent und asymptotisch normalverteilt sind. Im letzten Kapitel werden wir die Effizienz der Minimum-Distanz-Schätzer anhand simulierter Daten überprüfen. Ferner, werden Anwendungen auf reale Datensätze und deren Resultate ausführlich diskutiert.

On Finite Element Methods for 2nd order (semi–) periodic Eigenvalue Problems

We deal with a class of elliptic eigenvalue problems (EVPs) on a rectangle Ω ⊂ R^2 , with periodic or semi–periodic boundary conditions (BCs) on ∂Ω. First, for both types of EVPs, we pass to a proper variational formulation which is shown to fit into the general framework of abstract EVPs for symmetric, bounded, strongly coercive bilinear forms in Hilbert spaces, see, e.g., [13, §6.2]. Next, we consider finite element methods (FEMs) without and with numerical quadrature. The aim of the paper is to show that well–known error estimates, established for the finite element approximation of elliptic EVPs with classical BCs, hold for the present types of EVPs too. Some attention is also paid to the computational aspects of the resulting algebraic EVP. Finally, the analysis is illustrated by two non-trivial numerical examples, the exact eigenpairs of which can be determined.

Generalized Variational Inequalities for Upper Hemicontinuous and Demi Operators with Applications to Fixed Point Theorems in Hilbert Spaces

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

Two problems from the Polishchuk and Positselski book on Quadratic algebras

In the book ’Quadratic algebras’ by Polishchuk and Positselski [23] algebras with a small number of generators (n = 2, 3) are considered. For some number r of relations possible Hilbert series are listed, and those appearing as series of Koszul algebras are specified. The first case, where it was not possible to do, namely the case of three generators n = 3 and six relations r = 6 is formulated as an open problem. We give here a complete answer to this question, namely for quadratic algebras with dimA_1 = dimA_2 = 3, we list all possible Hilbert series, and find out which of them can come from Koszul algebras, and which can not. As a consequence of this classification, we found an algebra, which serves as a counterexample to another problem from the same book [23] (Chapter 7, Sec. 1, Conjecture 2), saying that Koszul algebra of finite global homological dimension d has dimA_1 > d. Namely, the 3-generated algebra A given by relations xx + yx = xz = zy = 0 is Koszul and its Koszul dual algebra A^! has Hilbert series of degree 4: HA! (t) = 1 + 3t + 3t^2 + 2t^3 + t^4, hence A has global homological dimension 4.