35 research outputs found

    Fraktionale Flussschätzung in aktiven Magnetlagern

    Get PDF
    Seit jeher sind Wirbelströme ein fester Bestandteil der Leistungsbilanz und Verlustberechnung in zahlreichen elektromagnetischen Energiewandlern. In aktiven Magnetlagern und Aktoren haben sie jedoch häufig einen zusätzlichen Einfluss auf die Kraftdynamik, da die einhergehende Feldverdrängung parasitäre Magnetisierungsströme hervorbringt, welche die meist strombasierten Kraftregler beeinträchtigen. Besonders betroffen sind die in dieser Dissertation beispielhaft betrachteten magnetischen Axiallager mit ihrer dreidimensionalen Flussführung, für welche die sonst übliche und effektive Blechung des Kerns unwirksam wird. Aus diesen Gründen werden regelungsbasierte Lösungen angestrebt. Bekannte fortschrittliche Topologien nutzen mitunter aufwendige Regler und Beobachter, wobei der direkte physikalische Bezug zu den mechanischen Parametern Steifigkeit und Dämpfung meist verloren geht. Diese Analogie zu mechanischen Lagern ist jedoch essentiell für eine einfache Inbetriebnahme des Magnetlagers, ein Grund, weshalb sich viele alternative Topologien nicht nachhaltig durchsetzen konnten und die dezentrale kaskadierte Lageregelung mit unterlagerter Stromregelung noch immer als weit verbreiteter Industriestandard gilt. Die in Axiallagern eingeschränkte Stabilität, Dynamik und Bandbreite aufgrund der Wirbelstromeffekte wird dabei zu Gunsten der einfacheren Anwendbarkeit toleriert. Diese Arbeit stellt ein fraktionales Kompensationsglied in Gestalt eines Flussschätzers vor, welches im Rückführungszweig der unterlagerten Regelung die Folgen der Wirbelströme dort herausrechnet, wo sie physikalisch wirken. Die resultierende modellbasierte Flussregelung erhält somit sämtliche physikalische Bezüge und die gute Anwendbarkeit, bei gleichzeitig verbesserten Regelungseigenschaften, sodass diesbezüglich keine Kompromisse notwendig sind. Das zugrundeliegende Modell leitet sich aus der Lösung der Diffusionsgleichung für den massiven Kern ab und stellt zunächst ein transzendentes fraktionales System dar, welches nicht direkt in einer Regelung anwendbar ist. Über Kettenbruchentwicklungen und Frequenzganganalysen ist es jedoch möglich, eine rationale Systembeschreibung zu ermitteln, die in Form einer digitalen Biquad-Filter-Kaskade auch in bestehende Mikroprozessor-Regelungen echtzeitfähig implementierbar ist. Die Arbeit dokumentiert das Vorgehen für eine Vielzahl von Randbedingungen und berücksichtigt verschiedene denkbare Einschränkungen, die in praktischen Anwendungen erwartbar sind. Der messtechnische Funktionsnachweis zeigt eine nahezu vollständige Kompensation der Wirbelstromeffekte in der unterlagerten Regelung, während sich die Bandbreite der Lageregelung nachweislich mindestens vervierfacht bei einem um bis zu 90 % Überschwingen gegenüber dem Industriestandard.Eddy currents have always been part of loss calculations and power balances in numerous electromagnetic energy converters. In active magnetic bearings and actuators they additionally have a great influence on the force dynamic, as the concomitant magnetic skin effect provokes parasitic magnetizing currents that impair the usually current-based force controllers. Thrust bearings with their three-dimensional flux propagation, which serve as example in this thesis, are especially affected, due to the ineffectiveness of the commonly applied lamination of the iron core. For these reasons, control-based solutions are desired. Known advanced control topologies employ possibly intricating controllers and observers, which hardly preserve the direct physical reference to mechanical parameters like stiffness and damping. However, this analogy to mechanical bearings is essential for a simple bearing operation. That is one reason why many alternative topologies could not been established sustainably and the decentralized cascaded position control with subordinated current control is considered as the indisputable industry standard. Its limitation of stability, dynamic and bandwidth, caused by the eddy current effects in thrust bearings, is only tolerated, in favor of a superior applicability. This thesis introduces a fractional-order compensation element in the form of a flux estimator that compensates the eddy currents effects, where they physically occur, to wit, within the feedback path of the subordinated control. Hence, the resulting flux control maintains all physical references and the simple applicability, but does not compromise on the control characteristic in this regard. The underlying model is derived from the solution of the diffusing equation that describes the nonlaminated core. It firstly constitutes a transcendental fractional-order system, which cannot be directly applied to a bearing control. However, by the use of continued fraction expansions and frequency analysis, a rational system description is determinable, which can be implemented as biquad filter cascade for real-time application even in existing microprocessor controls. This work documents the procedure for a variety of boundary conditions while considering various possible restrictions, which are to be expected in practical applications. The experimental proof of concept reveals a nearly complete compensation of the eddy current effects in the subordinated control. The bandwidth of the outer position control is at least quadrupled, while the overshoot can be reduced by up to 90 % compared to the industry standard

    A Fast Large-Integer Extended GCD Algorithm and Hardware Design for Verifiable Delay Functions and Modular Inversion

    Get PDF
    The extended GCD (XGCD) calculation, which computes Bézout coefficients ba, bb such that ba ∗ a0 + bb ∗ b0 = GCD(a0, b0), is a critical operation in many cryptographic applications. In particular, large-integer XGCD is computationally dominant for two applications of increasing interest: verifiable delay functions that square binary quadratic forms within a class group and constant-time modular inversion for elliptic curve cryptography. Most prior work has focused on fast software implementations. The few works investigating hardware acceleration build on variants of Euclid’s division-based algorithm, following the approach used in optimized software. We show that adopting variants of Stein’s subtraction-based algorithm instead leads to significantly faster hardware. We quantify this advantage by performing a large-integer XGCD accelerator design space exploration comparing Euclid- and Stein-based algorithms for various application requirements. This exploration leads us to an XGCD hardware accelerator that is flexible and efficient, supports fast average and constant-time evaluation, and is easily extensible for polynomial GCD. Our 16nm ASIC design calculates 1024-bit XGCD in 294ns (8x faster than the state-of-the-art ASIC) and constant-time 255-bit XGCD for inverses in the field of integers modulo the prime 2255−19 in 85ns (31× faster than state-of-the-art software). We believe our design is the first high-performance ASIC for the XGCD computation that is also capable of constant-time evaluation. Our work is publicly available at https://github.com/kavyasreedhar/sreedhar-xgcd-hardware-ches2022

    Die Zahl π – Mittelalter, Neuzeit, Moderne

    Get PDF
    Die Zahl π – Mittelalter, Neuzeit, Moderne, 44 p. - E88 - Neuss 2022 - encyclopedical survey, lots of researchers are listed including Lindemann, Hilbert, Ramanujan - important findings of in old history unknown properties are mentioned a) irationality of pi b) transcendence of pi - outlook on computers and p

    Die Zahl π – Altertum – Mittelalter – Neuzeit – Moderne -- Studien-Edition in einem Band

    Get PDF
    Die Zahl π – Altertum – Mittelalter – Neuzeit – Moderne -- Studien-Edition in einem Band, 186 p. - E89 - Neuss 2022 - starting with Papyrus Rhind to proofs for irrationality and transcendency of Pi - with lots of constructions and disrete approximations, including outlook on computers and Pi - We may guess: this type of near to encyclopedical survey is RARE - and was in NEED to see the public light, because it really can advance studies

    The Design and Implementation of a High-Performance Polynomial System Solver

    Get PDF
    This thesis examines the algorithmic and practical challenges of solving systems of polynomial equations. We discuss the design and implementation of triangular decomposition to solve polynomials systems exactly by means of symbolic computation. Incremental triangular decomposition solves one equation from the input list of polynomials at a time. Each step may produce several different components (points, curves, surfaces, etc.) of the solution set. Independent components imply that the solving process may proceed on each component concurrently. This so-called component-level parallelism is a theoretical and practical challenge characterized by irregular parallelism. Parallelism is not an algorithmic property but rather a geometrical property of the particular input system’s solution set. Despite these challenges, we have effectively applied parallel computing to triangular decomposition through the layering and cooperation of many parallel code regions. This parallel computing is supported by our generic object-oriented framework based on the dynamic multithreading paradigm. Meanwhile, the required polynomial algebra is sup- ported by an object-oriented framework for algebraic types which allows type safety and mathematical correctness to be determined at compile-time. Our software is implemented in C/C++ and have extensively tested the implementation for correctness and performance on over 3000 polynomial systems that have arisen in practice. The parallel framework has been re-used in the implementation of Hensel factorization as a parallel pipeline to compute roots of a polynomial with multivariate power series coefficients. Hensel factorization is one step toward computing the non-trivial limit points of quasi-components

    Cache-Friendly, Modular and Parallel Schemes For Computing Subresultant Chains

    Get PDF
    The RegularChains library in Maple offers a collection of commands for solving polynomial systems symbolically with taking advantage of the theory of regular chains. The primary goal of this thesis is algorithmic contributions, in particular, to high-performance computational schemes for subresultant chains and underlying routines to extend that of RegularChains in a C/C++ open-source library. Subresultants are one of the most fundamental tools in computer algebra. They are at the core of numerous algorithms including, but not limited to, polynomial GCD computations, polynomial system solving, and symbolic integration. When the subresultant chain of two polynomials is involved in a client procedure, not all polynomials of the chain, or not all coefficients of a given subresultant, may be needed. Based on that observation, we design so-called speculative and caching strategies which yield great performance improvements within our polynomial system solver. Our implementation of these techniques has been highly optimized. We have implemented optimized core arithmetic routines and multithreaded subresultant algorithms for univariate, bivariate and multivariate polynomials. We further examine memory access patterns and data locality for computing subresultants of multivariate polynomials, and study different optimization techniques for the fraction-free LU decomposition algorithm to compute subresultants based on determinant of Bezout matrices. Our code is publicly available at www.bpaslib.org as part of the Basic Polynomial Algebra Subprograms (BPAS) library that is mainly written in C, with concurrency support and user interfaces written in C++

    Fast algorithms for computing with integer matrices: normal forms and applications

    Get PDF
    The focus of this thesis is on fundamental computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving and computing integer matrix normal forms. Our goal is to design algorithms that have complexity about the same as the cost of multiplying together two integer matrices of the same dimension and size of entries as the input matrix A. If 2 ≤ ω ≤ 3 is a valid exponent for matrix multiplication, that is, if two n × n matrices can be multiplied in O(n^ω) basic operations from the domain of entries, then our target complexity is O(n^ω log ||A||) bit operations, up to some missing log n and loglog ||A|| factors. Here ||A|| denotes the largest entry in A in absolute value. The first contribution is solving the problem of computing the Smith normal form S of a nonsingular matrix A along with computing unimodular matrices U, V such that AV = US within our target cost. The algorithm we give is a Las Vegas probabilistic algorithm which means that we are able to verify the correctness of its output. The second contribution of the thesis is with respect to linear system solving. We present a deterministic reduction to matrix multiplication for the problem of linear system solving: given as input a nonsingular A and a vector b, solve the system Ax = b. The system solution x is computed within our target complexity

    On the complexity of inverting integer and polynomial matrices

    Get PDF
    Abstract An algorithm is presented that probabilistically computes the exact inverse of a nonsingular n × n integer matrix A using O˜(n 3 (log ||A|| + log κ(A))) bit operations. Here, ||A|| = max ij |A ij | denotes the largest entry in absolute value, κ(A) := ||A −1 || ||A|| is the condition number of the input matrix, and the soft-O notation O˜indicates some missing log n and log log ||A|| factors. A variation of the algorithm is presented for polynomial matrices. The inverse of any nonsingular n × n matrix whose entries are polynomials of degree d over a field can be computed using an expected number of O˜(n 3 d) field operations. Both algorithms are randomized of the Las Vegas type: fail may be returned with probability at most 1/2, and if fail is not returned the output is certified to be correct in the same running time bound

    Full Orbit Sequences in Affine Spaces via Fractional Jumps and Pseudorandom Number Generation

    Full text link
    Let nn be a positive integer. In this paper we provide a general theory to produce full orbit sequences in the affine nn-dimensional space over a finite field. For n=1n=1 our construction covers the case of the Inversive Congruential Generators (ICG). In addition, for n>1n>1 we show that the sequences produced using our construction are easier to compute than ICG sequences. Furthermore, we prove that they have the same discrepancy bounds as the ones constructed using the ICG.Comment: To appear in Mathematics of Computatio
    corecore