Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Aspergillus niger  (1)
  • Linear programming  (1)
  • Modified pruning technique  (1)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Algorithmica 1 (1986), S. 455-482 
    ISSN: 1432-0541
    Schlagwort(e): Linear programming ; Interior method ; Barrier function ; Newton method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A simple Newton-like descent algorithm for linear programming is proposed together with results of preliminary computational experiments on small- and medium-size problems. The proposed algorithm gives local superlinear convergence to the optimum and, experimentally, shows global linear convergence. It is similar to Karmarkar's algorithm in that it is an interior feasible direction method and self-correcting, while it is quite different from Karmarkar's in that it gives superlinear convergence and that no artificial extra constraint is introduced nor is protective geometry needed, but only affine geometry suffices.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Algorithmica 4 (1989), S. 77-96 
    ISSN: 1432-0541
    Schlagwort(e): Computational geometry ; Modified pruning technique ; LinearL 1 approximation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we present a linear-time algorithm for approximating a set ofn points by a linear function, or a line, that minimizes theL 1 norm. The algorithmic complexity of this problem appears not to have been investigated, although anO(n 3) naive algorithm can be easily obtained based on some simple characteristics of an optimumL 1 solution. Our linear-time algorithm is optimal within a constant factor and enables us to use linearL 1 approximation of many points in practice. The complexity ofL 1 linear approximation of a piecewise linear function is also touched upon.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 56 (1997), S. 689-696 
    ISSN: 0006-3592
    Schlagwort(e): citric acid ; Aspergillus niger ; rotating disk contactor ; simulation ; biofilm ; Chemistry ; Biochemistry and Biotechnology
    Quelle: Wiley InterScience Backfile Collection 1832-2000
    Thema: Biologie , Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
    Notizen: A simple model was presented to describe the time courses of citric acid production by a rotating disc contactor (RDC) using Aspergillus niger. The model is expressed by Monod-type cell growth, Luedeking-Piret-type citric acid production rate equations, and the diffusion equation for oxygen in the biofilm. The model contains five parameters which were determined by the nonlinear least squares method by fitting the numerical solution to the experimental data. In solving the equations, the cell density of the biofilm was estimated from the value of cellular mass per unit of biofilm area using an empirical equation. The experimental time courses in citric acid production period were well simulated with this model. The relation between the specific biofilm surface area and the rate of citric acid production was also explained by the simulation using the average values of five parameters of twelve runs. © 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 56: 689-696, 1997.
    Zusätzliches Material: 9 Ill.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...