---
_id: '34893'
abstract:
- lang: eng
  text: Let K be a global field and O be an order of K. We develop algorithms for
    the computation of the unit group of residue class rings for ideals O in . As
    an application we show how to compute the unit group and the Picard group of O
    provided that we are able to compute the unit group and class group of the maximal
    order O of K.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Sebastian
  full_name: Pauli, Sebastian
  last_name: Pauli
citation:
  ama: Klüners J, Pauli S. Computing residue class rings and Picard groups of orders.
    <i>Journal of Algebra</i>. 2005;292(1):47-64. doi:<a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">10.1016/j.jalgebra.2005.04.013</a>
  apa: Klüners, J., &#38; Pauli, S. (2005). Computing residue class rings and Picard
    groups of orders. <i>Journal of Algebra</i>, <i>292</i>(1), 47–64. <a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">https://doi.org/10.1016/j.jalgebra.2005.04.013</a>
  bibtex: '@article{Klüners_Pauli_2005, title={Computing residue class rings and Picard
    groups of orders}, volume={292}, DOI={<a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">10.1016/j.jalgebra.2005.04.013</a>},
    number={1}, journal={Journal of Algebra}, publisher={Elsevier BV}, author={Klüners,
    Jürgen and Pauli, Sebastian}, year={2005}, pages={47–64} }'
  chicago: 'Klüners, Jürgen, and Sebastian Pauli. “Computing Residue Class Rings and
    Picard Groups of Orders.” <i>Journal of Algebra</i> 292, no. 1 (2005): 47–64.
    <a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">https://doi.org/10.1016/j.jalgebra.2005.04.013</a>.'
  ieee: 'J. Klüners and S. Pauli, “Computing residue class rings and Picard groups
    of orders,” <i>Journal of Algebra</i>, vol. 292, no. 1, pp. 47–64, 2005, doi:
    <a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">10.1016/j.jalgebra.2005.04.013</a>.'
  mla: Klüners, Jürgen, and Sebastian Pauli. “Computing Residue Class Rings and Picard
    Groups of Orders.” <i>Journal of Algebra</i>, vol. 292, no. 1, Elsevier BV, 2005,
    pp. 47–64, doi:<a href="https://doi.org/10.1016/j.jalgebra.2005.04.013">10.1016/j.jalgebra.2005.04.013</a>.
  short: J. Klüners, S. Pauli, Journal of Algebra 292 (2005) 47–64.
date_created: 2022-12-23T09:41:06Z
date_updated: 2023-03-06T09:55:09Z
department:
- _id: '102'
doi: 10.1016/j.jalgebra.2005.04.013
intvolume: '       292'
issue: '1'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 47-64
publication: Journal of Algebra
publication_identifier:
  issn:
  - 0021-8693
publication_status: published
publisher: Elsevier BV
status: public
title: Computing residue class rings and Picard groups of orders
type: journal_article
user_id: '93826'
volume: 292
year: '2005'
...
---
_id: '11931'
abstract:
- lang: eng
  text: The paper is concerned with binaural signal processing for a bimodal human-robot
    interface with hearing and vision. The two microphone signals are processed to
    obtain an enhanced single-channel input signal for the subsequent speech recognizer
    and to localize the acoustic source, an important information for establishing
    a natural human-robot communication. We utilize a robust adaptive algorithm for
    filter-and-sum beamforming (FSB) and extract speaker direction information from
    the resulting FIR filter coefficients. Further, particle filtering is applied
    which conducts a nonlinear Bayesian tracking of speaker movement. Good location
    accuracy can be achieved even in highly reverberant environments. The results
    obtained outperform the conventional generalized cross correlation (GCC) method.
author:
- first_name: Ernst
  full_name: Warsitz, Ernst
  last_name: Warsitz
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
citation:
  ama: 'Warsitz E, Haeb-Umbach R. Robust speaker direction estimation with particle
    filtering. In: <i>IEEE Workshop on Multimedia Signal Processing (MMSP 2004)</i>.
    ; 2004:367-370. doi:<a href="https://doi.org/10.1109/MMSP.2004.1436569">10.1109/MMSP.2004.1436569</a>'
  apa: Warsitz, E., &#38; Haeb-Umbach, R. (2004). Robust speaker direction estimation
    with particle filtering. In <i>IEEE Workshop on Multimedia Signal Processing (MMSP
    2004)</i> (pp. 367–370). <a href="https://doi.org/10.1109/MMSP.2004.1436569">https://doi.org/10.1109/MMSP.2004.1436569</a>
  bibtex: '@inproceedings{Warsitz_Haeb-Umbach_2004, title={Robust speaker direction
    estimation with particle filtering}, DOI={<a href="https://doi.org/10.1109/MMSP.2004.1436569">10.1109/MMSP.2004.1436569</a>},
    booktitle={IEEE Workshop on Multimedia Signal Processing (MMSP 2004)}, author={Warsitz,
    Ernst and Haeb-Umbach, Reinhold}, year={2004}, pages={367–370} }'
  chicago: Warsitz, Ernst, and Reinhold Haeb-Umbach. “Robust Speaker Direction Estimation
    with Particle Filtering.” In <i>IEEE Workshop on Multimedia Signal Processing
    (MMSP 2004)</i>, 367–70, 2004. <a href="https://doi.org/10.1109/MMSP.2004.1436569">https://doi.org/10.1109/MMSP.2004.1436569</a>.
  ieee: E. Warsitz and R. Haeb-Umbach, “Robust speaker direction estimation with particle
    filtering,” in <i>IEEE Workshop on Multimedia Signal Processing (MMSP 2004)</i>,
    2004, pp. 367–370.
  mla: Warsitz, Ernst, and Reinhold Haeb-Umbach. “Robust Speaker Direction Estimation
    with Particle Filtering.” <i>IEEE Workshop on Multimedia Signal Processing (MMSP
    2004)</i>, 2004, pp. 367–70, doi:<a href="https://doi.org/10.1109/MMSP.2004.1436569">10.1109/MMSP.2004.1436569</a>.
  short: 'E. Warsitz, R. Haeb-Umbach, in: IEEE Workshop on Multimedia Signal Processing
    (MMSP 2004), 2004, pp. 367–370.'
date_created: 2019-07-12T05:31:01Z
date_updated: 2022-01-06T06:51:12Z
department:
- _id: '54'
doi: 10.1109/MMSP.2004.1436569
keyword:
- bimodal human-robot interface
- binaural signal processing
- enhanced single-channel input signal
- filter-and-sum beamforming
- filtering theory
- FIR filter coefficient
- generalized cross correlation method
- microphones
- microphone signal
- nonlinear Bayesian tracking
- particle filtering
- robust adaptive algorithm
- robust speaker direction estimation
- signal processing
- speech enhancement
- speech recognition
- speech recognizer
- user interfaces
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://groups.uni-paderborn.de/nt/pubs/2004/WaHa04.pdf
oa: '1'
page: 367-370
publication: IEEE Workshop on Multimedia Signal Processing (MMSP 2004)
status: public
title: Robust speaker direction estimation with particle filtering
type: conference
user_id: '44006'
year: '2004'
...
---
_id: '39061'
abstract:
- lang: eng
  text: This article presents an approach, which combines theorem proving-based refinement
    with model checking for state based real-time systems. Our verification flow starts
    from UML state diagrams, which are translated to the formal B language and are
    model checked for real-time properties. By means of the B language and a B theorem
    prover, refined state diagrams are verified against their abstract representation.
    The approach is presented by means of the refinement of a digital echo cancellation
    unit.
author:
- first_name: Alexander
  full_name: Krupp, Alexander
  last_name: Krupp
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
- first_name: Ian
  full_name: Oliver, Ian
  last_name: Oliver
citation:
  ama: 'Krupp A, Müller W, Oliver I. Formal Refinement and Model Checking of An Echo
    Cancellation Unit. In: <i>Proceedings of DATE’04 Designers’ Forum</i>. ; 2004.
    doi:<a href="https://doi.org/10.1109/DATE.2004.1269214">10.1109/DATE.2004.1269214</a>'
  apa: Krupp, A., Müller, W., &#38; Oliver, I. (2004). Formal Refinement and Model
    Checking of An Echo Cancellation Unit. <i>Proceedings of DATE’04 Designers’ Forum</i>.
    Proceedings Design, Automation and Test in Europe Conference and Exhibition. <a
    href="https://doi.org/10.1109/DATE.2004.1269214">https://doi.org/10.1109/DATE.2004.1269214</a>
  bibtex: '@inproceedings{Krupp_Müller_Oliver_2004, place={Paris}, title={Formal Refinement
    and Model Checking of An Echo Cancellation Unit}, DOI={<a href="https://doi.org/10.1109/DATE.2004.1269214">10.1109/DATE.2004.1269214</a>},
    booktitle={Proceedings of DATE’04 Designers’ Forum}, author={Krupp, Alexander
    and Müller, Wolfgang and Oliver, Ian}, year={2004} }'
  chicago: Krupp, Alexander, Wolfgang Müller, and Ian Oliver. “Formal Refinement and
    Model Checking of An Echo Cancellation Unit.” In <i>Proceedings of DATE’04 Designers’
    Forum</i>. Paris, 2004. <a href="https://doi.org/10.1109/DATE.2004.1269214">https://doi.org/10.1109/DATE.2004.1269214</a>.
  ieee: 'A. Krupp, W. Müller, and I. Oliver, “Formal Refinement and Model Checking
    of An Echo Cancellation Unit,” presented at the Proceedings Design, Automation
    and Test in Europe Conference and Exhibition, 2004, doi: <a href="https://doi.org/10.1109/DATE.2004.1269214">10.1109/DATE.2004.1269214</a>.'
  mla: Krupp, Alexander, et al. “Formal Refinement and Model Checking of An Echo Cancellation
    Unit.” <i>Proceedings of DATE’04 Designers’ Forum</i>, 2004, doi:<a href="https://doi.org/10.1109/DATE.2004.1269214">10.1109/DATE.2004.1269214</a>.
  short: 'A. Krupp, W. Müller, I. Oliver, in: Proceedings of DATE’04 Designers’ Forum,
    Paris, 2004.'
conference:
  name: Proceedings Design, Automation and Test in Europe Conference and Exhibition
date_created: 2023-01-24T08:53:26Z
date_updated: 2023-01-24T08:53:31Z
department:
- _id: '672'
doi: 10.1109/DATE.2004.1269214
keyword:
- Echo cancellers
- Logic
- Unified modeling language
- Automata
- Data structures
- Boolean functions
- Electronic design automation and methodology
- Prototypes
- Specification languages
- Constraint theory
language:
- iso: eng
place: Paris
publication: Proceedings of DATE’04 Designers' Forum
publication_identifier:
  isbn:
  - 0-7695-2085-5
status: public
title: Formal Refinement and Model Checking of An Echo Cancellation Unit
type: conference
user_id: '5786'
year: '2004'
...
---
_id: '34896'
abstract:
- lang: eng
  text: We apply class field theory to the computation of the minimal discriminants
    for certain solvable groups. In particular, we apply our techniques to small Frobenius
    groups and all imprimitive degree 8 groups such that the corresponding fields
    have only a degree 2 and no degree 4 subfield.
author:
- first_name: Claus
  full_name: Fieker, Claus
  last_name: Fieker
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Fieker C, Klüners J. Minimal discriminants for fields with small Frobenius
    groups as Galois groups. <i>Journal of Number Theory</i>. 2003;99(2):318-337.
    doi:<a href="https://doi.org/10.1016/s0022-314x(02)00071-9">10.1016/s0022-314x(02)00071-9</a>
  apa: Fieker, C., &#38; Klüners, J. (2003). Minimal discriminants for fields with
    small Frobenius groups as Galois groups. <i>Journal of Number Theory</i>, <i>99</i>(2),
    318–337. <a href="https://doi.org/10.1016/s0022-314x(02)00071-9">https://doi.org/10.1016/s0022-314x(02)00071-9</a>
  bibtex: '@article{Fieker_Klüners_2003, title={Minimal discriminants for fields with
    small Frobenius groups as Galois groups}, volume={99}, DOI={<a href="https://doi.org/10.1016/s0022-314x(02)00071-9">10.1016/s0022-314x(02)00071-9</a>},
    number={2}, journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Fieker,
    Claus and Klüners, Jürgen}, year={2003}, pages={318–337} }'
  chicago: 'Fieker, Claus, and Jürgen Klüners. “Minimal Discriminants for Fields with
    Small Frobenius Groups as Galois Groups.” <i>Journal of Number Theory</i> 99,
    no. 2 (2003): 318–37. <a href="https://doi.org/10.1016/s0022-314x(02)00071-9">https://doi.org/10.1016/s0022-314x(02)00071-9</a>.'
  ieee: 'C. Fieker and J. Klüners, “Minimal discriminants for fields with small Frobenius
    groups as Galois groups,” <i>Journal of Number Theory</i>, vol. 99, no. 2, pp.
    318–337, 2003, doi: <a href="https://doi.org/10.1016/s0022-314x(02)00071-9">10.1016/s0022-314x(02)00071-9</a>.'
  mla: Fieker, Claus, and Jürgen Klüners. “Minimal Discriminants for Fields with Small
    Frobenius Groups as Galois Groups.” <i>Journal of Number Theory</i>, vol. 99,
    no. 2, Elsevier BV, 2003, pp. 318–37, doi:<a href="https://doi.org/10.1016/s0022-314x(02)00071-9">10.1016/s0022-314x(02)00071-9</a>.
  short: C. Fieker, J. Klüners, Journal of Number Theory 99 (2003) 318–337.
date_created: 2022-12-23T09:53:23Z
date_updated: 2023-03-06T09:19:16Z
department:
- _id: '102'
doi: 10.1016/s0022-314x(02)00071-9
intvolume: '        99'
issue: '2'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 318-337
publication: Journal of Number Theory
publication_identifier:
  issn:
  - 0022-314X
publication_status: published
publisher: Elsevier BV
status: public
title: Minimal discriminants for fields with small Frobenius groups as Galois groups
type: journal_article
user_id: '93826'
volume: 99
year: '2003'
...
---
_id: '45423'
author:
- first_name: Rolf
  full_name: Mahnken, Rolf
  id: '335'
  last_name: Mahnken
citation:
  ama: Mahnken R. Improved implementation of an algorithm for non-linear isotropic/kinematic
    hardening in elastoplasticity. <i>Communications in Numerical Methods in Engineering</i>.
    2002;15(10):745-754. doi:<a href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>
  apa: Mahnken, R. (2002). Improved implementation of an algorithm for non-linear
    isotropic/kinematic hardening in elastoplasticity. <i>Communications in Numerical
    Methods in Engineering</i>, <i>15</i>(10), 745–754. <a href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>
  bibtex: '@article{Mahnken_2002, title={Improved implementation of an algorithm for
    non-linear isotropic/kinematic hardening in elastoplasticity}, volume={15}, DOI={<a
    href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>},
    number={10}, journal={Communications in Numerical Methods in Engineering}, publisher={Wiley},
    author={Mahnken, Rolf}, year={2002}, pages={745–754} }'
  chicago: 'Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear
    Isotropic/Kinematic Hardening in Elastoplasticity.” <i>Communications in Numerical
    Methods in Engineering</i> 15, no. 10 (2002): 745–54. <a href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.'
  ieee: 'R. Mahnken, “Improved implementation of an algorithm for non-linear isotropic/kinematic
    hardening in elastoplasticity,” <i>Communications in Numerical Methods in Engineering</i>,
    vol. 15, no. 10, pp. 745–754, 2002, doi: <a href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.'
  mla: Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear Isotropic/Kinematic
    Hardening in Elastoplasticity.” <i>Communications in Numerical Methods in Engineering</i>,
    vol. 15, no. 10, Wiley, 2002, pp. 745–54, doi:<a href="https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.
  short: R. Mahnken, Communications in Numerical Methods in Engineering 15 (2002)
    745–754.
date_created: 2023-05-31T12:14:42Z
date_updated: 2023-05-31T12:15:12Z
department:
- _id: '9'
- _id: '154'
doi: 10.1002/(sici)1099-0887(199910)15:10<745::aid-cnm288>3.0.co;2-r
intvolume: '        15'
issue: '10'
keyword:
- Applied Mathematics
- Computational Theory and Mathematics
- General Engineering
- Modeling and Simulation
- Software
language:
- iso: eng
page: 745-754
publication: Communications in Numerical Methods in Engineering
publication_identifier:
  issn:
  - 1069-8299
  - 1099-0887
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Improved implementation of an algorithm for non-linear isotropic/kinematic
  hardening in elastoplasticity
type: journal_article
user_id: '335'
volume: 15
year: '2002'
...
---
_id: '45417'
author:
- first_name: C.
  full_name: Döbert, C.
  last_name: Döbert
- first_name: Rolf
  full_name: Mahnken, Rolf
  id: '335'
  last_name: Mahnken
- first_name: E.
  full_name: Stein, E.
  last_name: Stein
citation:
  ama: Döbert C, Mahnken R, Stein E. Numerical simulation of interface debonding with
    a combined damage/friction constitutive model. <i>Computational Mechanics</i>.
    2002;25(5):456-467. doi:<a href="https://doi.org/10.1007/s004660050493">10.1007/s004660050493</a>
  apa: Döbert, C., Mahnken, R., &#38; Stein, E. (2002). Numerical simulation of interface
    debonding with a combined damage/friction constitutive model. <i>Computational
    Mechanics</i>, <i>25</i>(5), 456–467. <a href="https://doi.org/10.1007/s004660050493">https://doi.org/10.1007/s004660050493</a>
  bibtex: '@article{Döbert_Mahnken_Stein_2002, title={Numerical simulation of interface
    debonding with a combined damage/friction constitutive model}, volume={25}, DOI={<a
    href="https://doi.org/10.1007/s004660050493">10.1007/s004660050493</a>}, number={5},
    journal={Computational Mechanics}, publisher={Springer Science and Business Media
    LLC}, author={Döbert, C. and Mahnken, Rolf and Stein, E.}, year={2002}, pages={456–467}
    }'
  chicago: 'Döbert, C., Rolf Mahnken, and E. Stein. “Numerical Simulation of Interface
    Debonding with a Combined Damage/Friction Constitutive Model.” <i>Computational
    Mechanics</i> 25, no. 5 (2002): 456–67. <a href="https://doi.org/10.1007/s004660050493">https://doi.org/10.1007/s004660050493</a>.'
  ieee: 'C. Döbert, R. Mahnken, and E. Stein, “Numerical simulation of interface debonding
    with a combined damage/friction constitutive model,” <i>Computational Mechanics</i>,
    vol. 25, no. 5, pp. 456–467, 2002, doi: <a href="https://doi.org/10.1007/s004660050493">10.1007/s004660050493</a>.'
  mla: Döbert, C., et al. “Numerical Simulation of Interface Debonding with a Combined
    Damage/Friction Constitutive Model.” <i>Computational Mechanics</i>, vol. 25,
    no. 5, Springer Science and Business Media LLC, 2002, pp. 456–67, doi:<a href="https://doi.org/10.1007/s004660050493">10.1007/s004660050493</a>.
  short: C. Döbert, R. Mahnken, E. Stein, Computational Mechanics 25 (2002) 456–467.
date_created: 2023-05-31T12:04:03Z
date_updated: 2023-05-31T12:04:35Z
department:
- _id: '9'
- _id: '154'
doi: 10.1007/s004660050493
intvolume: '        25'
issue: '5'
keyword:
- Applied Mathematics
- Computational Mathematics
- Computational Theory and Mathematics
- Mechanical Engineering
- Ocean Engineering
- Computational Mechanics
language:
- iso: eng
page: 456-467
publication: Computational Mechanics
publication_identifier:
  issn:
  - 0178-7675
  - 1432-0924
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
status: public
title: Numerical simulation of interface debonding with a combined damage/friction
  constitutive model
type: journal_article
user_id: '335'
volume: 25
year: '2002'
...
---
_id: '45427'
abstract:
- lang: eng
  text: '<jats:p>In this work a gradient‐based optimization method is applied in order
    to determine material parameters for a viscoplastic model with dynamic yield surface
    coupled to damage as presented in 1997. To this end a sensitivity analysis consistent
    with the integration scheme presented previously is performed in a systematic
    manner, both for strain and stress controlled experiments. The algorithm is tested
    in two numerical examples: first, simulated data are used, in order to re‐obtain
    parameters for the case of damage under monotonic loading. In the second example
    material parameters are obtained based on experimental data for lcf‐testing of
    an austenetic stainless steel, thus showing a very good agreement with respect
    to hardening, rate and damage effects.</jats:p>'
author:
- first_name: Rolf
  full_name: Mahnken, Rolf
  id: '335'
  last_name: Mahnken
- first_name: Magnus
  full_name: Johansson, Magnus
  last_name: Johansson
- first_name: Kenneth
  full_name: Runesson, Kenneth
  last_name: Runesson
citation:
  ama: Mahnken R, Johansson M, Runesson K. Parameter estimation for a viscoplastic
    damage model using a gradient‐based optimization algorithm. <i>Engineering Computations</i>.
    2002;15(7):925-955. doi:<a href="https://doi.org/10.1108/02644409810236920">10.1108/02644409810236920</a>
  apa: Mahnken, R., Johansson, M., &#38; Runesson, K. (2002). Parameter estimation
    for a viscoplastic damage model using a gradient‐based optimization algorithm.
    <i>Engineering Computations</i>, <i>15</i>(7), 925–955. <a href="https://doi.org/10.1108/02644409810236920">https://doi.org/10.1108/02644409810236920</a>
  bibtex: '@article{Mahnken_Johansson_Runesson_2002, title={Parameter estimation for
    a viscoplastic damage model using a gradient‐based optimization algorithm}, volume={15},
    DOI={<a href="https://doi.org/10.1108/02644409810236920">10.1108/02644409810236920</a>},
    number={7}, journal={Engineering Computations}, publisher={Emerald}, author={Mahnken,
    Rolf and Johansson, Magnus and Runesson, Kenneth}, year={2002}, pages={925–955}
    }'
  chicago: 'Mahnken, Rolf, Magnus Johansson, and Kenneth Runesson. “Parameter Estimation
    for a Viscoplastic Damage Model Using a Gradient‐based Optimization Algorithm.”
    <i>Engineering Computations</i> 15, no. 7 (2002): 925–55. <a href="https://doi.org/10.1108/02644409810236920">https://doi.org/10.1108/02644409810236920</a>.'
  ieee: 'R. Mahnken, M. Johansson, and K. Runesson, “Parameter estimation for a viscoplastic
    damage model using a gradient‐based optimization algorithm,” <i>Engineering Computations</i>,
    vol. 15, no. 7, pp. 925–955, 2002, doi: <a href="https://doi.org/10.1108/02644409810236920">10.1108/02644409810236920</a>.'
  mla: Mahnken, Rolf, et al. “Parameter Estimation for a Viscoplastic Damage Model
    Using a Gradient‐based Optimization Algorithm.” <i>Engineering Computations</i>,
    vol. 15, no. 7, Emerald, 2002, pp. 925–55, doi:<a href="https://doi.org/10.1108/02644409810236920">10.1108/02644409810236920</a>.
  short: R. Mahnken, M. Johansson, K. Runesson, Engineering Computations 15 (2002)
    925–955.
date_created: 2023-05-31T12:20:54Z
date_updated: 2023-05-31T12:21:15Z
department:
- _id: '9'
- _id: '154'
doi: 10.1108/02644409810236920
intvolume: '        15'
issue: '7'
keyword:
- Computational Theory and Mathematics
- Computer Science Applications
- General Engineering
- Software
language:
- iso: eng
page: 925-955
publication: Engineering Computations
publication_identifier:
  issn:
  - 0264-4401
publication_status: published
publisher: Emerald
quality_controlled: '1'
status: public
title: Parameter estimation for a viscoplastic damage model using a gradient‐based
  optimization algorithm
type: journal_article
user_id: '335'
volume: 15
year: '2002'
...
---
_id: '34897'
abstract:
- lang: eng
  text: This paper announces the creation of a database for number fields. It describes
    the contents and the methods of access, indicates the origin of the polynomials,
    and formulates the aims of this collection of fields.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Gunter
  full_name: Malle, Gunter
  last_name: Malle
citation:
  ama: Klüners J, Malle G. A Database for Field Extensions of the Rationals. <i>LMS
    Journal of Computation and Mathematics</i>. 2001;4:182-196. doi:<a href="https://doi.org/10.1112/s1461157000000851">10.1112/s1461157000000851</a>
  apa: Klüners, J., &#38; Malle, G. (2001). A Database for Field Extensions of the
    Rationals. <i>LMS Journal of Computation and Mathematics</i>, <i>4</i>, 182–196.
    <a href="https://doi.org/10.1112/s1461157000000851">https://doi.org/10.1112/s1461157000000851</a>
  bibtex: '@article{Klüners_Malle_2001, title={A Database for Field Extensions of
    the Rationals}, volume={4}, DOI={<a href="https://doi.org/10.1112/s1461157000000851">10.1112/s1461157000000851</a>},
    journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Klüners,
    Jürgen and Malle, Gunter}, year={2001}, pages={182–196} }'
  chicago: 'Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of
    the Rationals.” <i>LMS Journal of Computation and Mathematics</i> 4 (2001): 182–96.
    <a href="https://doi.org/10.1112/s1461157000000851">https://doi.org/10.1112/s1461157000000851</a>.'
  ieee: 'J. Klüners and G. Malle, “A Database for Field Extensions of the Rationals,”
    <i>LMS Journal of Computation and Mathematics</i>, vol. 4, pp. 182–196, 2001,
    doi: <a href="https://doi.org/10.1112/s1461157000000851">10.1112/s1461157000000851</a>.'
  mla: Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of the
    Rationals.” <i>LMS Journal of Computation and Mathematics</i>, vol. 4, Wiley,
    2001, pp. 182–96, doi:<a href="https://doi.org/10.1112/s1461157000000851">10.1112/s1461157000000851</a>.
  short: J. Klüners, G. Malle, LMS Journal of Computation and Mathematics 4 (2001)
    182–196.
date_created: 2022-12-23T09:56:22Z
date_updated: 2023-03-02T09:53:08Z
department:
- _id: '102'
doi: 10.1112/s1461157000000851
external_id:
  arxiv:
  - math/0102232
intvolume: '         4'
keyword:
- Computational Theory and Mathematics
- General Mathematics
language:
- iso: eng
page: 182-196
publication: LMS Journal of Computation and Mathematics
publication_identifier:
  issn:
  - 1461-1570
publication_status: published
publisher: Wiley
status: public
title: A Database for Field Extensions of the Rationals
type: journal_article
user_id: '93826'
volume: 4
year: '2001'
...
---
_id: '34900'
abstract:
- lang: eng
  text: We describe methods for the computation of Galois groups of univariate polynomials
    over the rationals which we have implemented up to degree 15. These methods are
    based on Stauduhar’s algorithm. All computations are done in unramified p -adic
    extensions. For imprimitive groups we give an improvement using subfields. In
    the primitive case we use known subgroups of the Galois group together with a
    combination of Stauduhar’s method and the absolute resolvent method.
author:
- first_name: Katharina
  full_name: Geissler, Katharina
  last_name: Geissler
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Geissler K, Klüners J. Galois Group Computation for Rational Polynomials. <i>Journal
    of Symbolic Computation</i>. 2000;30(6):653-674. doi:<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>
  apa: Geissler, K., &#38; Klüners, J. (2000). Galois Group Computation for Rational
    Polynomials. <i>Journal of Symbolic Computation</i>, <i>30</i>(6), 653–674. <a
    href="https://doi.org/10.1006/jsco.2000.0377">https://doi.org/10.1006/jsco.2000.0377</a>
  bibtex: '@article{Geissler_Klüners_2000, title={Galois Group Computation for Rational
    Polynomials}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Geissler, Katharina and Klüners, Jürgen}, year={2000}, pages={653–674}
    }'
  chicago: 'Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for
    Rational Polynomials.” <i>Journal of Symbolic Computation</i> 30, no. 6 (2000):
    653–74. <a href="https://doi.org/10.1006/jsco.2000.0377">https://doi.org/10.1006/jsco.2000.0377</a>.'
  ieee: 'K. Geissler and J. Klüners, “Galois Group Computation for Rational Polynomials,”
    <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, pp. 653–674, 2000, doi:
    <a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>.'
  mla: Geissler, Katharina, and Jürgen Klüners. “Galois Group Computation for Rational
    Polynomials.” <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, Elsevier
    BV, 2000, pp. 653–74, doi:<a href="https://doi.org/10.1006/jsco.2000.0377">10.1006/jsco.2000.0377</a>.
  short: K. Geissler, J. Klüners, Journal of Symbolic Computation 30 (2000) 653–674.
date_created: 2022-12-23T09:58:16Z
date_updated: 2023-03-06T09:58:06Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0377
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 653-674
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Galois Group Computation for Rational Polynomials
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34901'
abstract:
- lang: eng
  text: Let L = K(α) be an Abelian extension of degree n of a number field K, given
    by the minimal polynomial of α over K. We describe an algorithm for computing
    the local Artin map associated with the extension L / K at a finite or infinite
    prime v of K. We apply this algorithm to decide if a nonzero a ∈ K is a norm from
    L, assuming that L / K is cyclic.
author:
- first_name: Vincenzo
  full_name: Acciaro, Vincenzo
  last_name: Acciaro
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Acciaro V, Klüners J. Computing Local Artin Maps, and Solvability of Norm Equations.
    <i>Journal of Symbolic Computation</i>. 2000;30(3):239-252. doi:<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>
  apa: Acciaro, V., &#38; Klüners, J. (2000). Computing Local Artin Maps, and Solvability
    of Norm Equations. <i>Journal of Symbolic Computation</i>, <i>30</i>(3), 239–252.
    <a href="https://doi.org/10.1006/jsco.2000.0361">https://doi.org/10.1006/jsco.2000.0361</a>
  bibtex: '@article{Acciaro_Klüners_2000, title={Computing Local Artin Maps, and Solvability
    of Norm Equations}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>},
    number={3}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Acciaro, Vincenzo and Klüners, Jürgen}, year={2000}, pages={239–252} }'
  chicago: 'Acciaro, Vincenzo, and Jürgen Klüners. “Computing Local Artin Maps, and
    Solvability of Norm Equations.” <i>Journal of Symbolic Computation</i> 30, no.
    3 (2000): 239–52. <a href="https://doi.org/10.1006/jsco.2000.0361">https://doi.org/10.1006/jsco.2000.0361</a>.'
  ieee: 'V. Acciaro and J. Klüners, “Computing Local Artin Maps, and Solvability of
    Norm Equations,” <i>Journal of Symbolic Computation</i>, vol. 30, no. 3, pp. 239–252,
    2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>.'
  mla: Acciaro, Vincenzo, and Jürgen Klüners. “Computing Local Artin Maps, and Solvability
    of Norm Equations.” <i>Journal of Symbolic Computation</i>, vol. 30, no. 3, Elsevier
    BV, 2000, pp. 239–52, doi:<a href="https://doi.org/10.1006/jsco.2000.0361">10.1006/jsco.2000.0361</a>.
  short: V. Acciaro, J. Klüners, Journal of Symbolic Computation 30 (2000) 239–252.
date_created: 2022-12-23T09:58:48Z
date_updated: 2023-03-06T09:57:34Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0361
intvolume: '        30'
issue: '3'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 239-252
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Computing Local Artin Maps, and Solvability of Norm Equations
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34899'
abstract:
- lang: eng
  text: We describe methods for the construction of polynomials with certain types
    of Galois groups. As an application we deduce that all transitive groups G up
    to degree 15 occur as Galois groups of regular extensions of ℚ (t), and in each
    case compute a polynomial f ∈ ℚ [ x ] with Gal(f)  = G.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Gunter
  full_name: Malle, Gunter
  last_name: Malle
citation:
  ama: Klüners J, Malle G. Explicit Galois Realization of Transitive Groups of Degree
    up to 15. <i>Journal of Symbolic Computation</i>. 2000;30(6):675-716. doi:<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>
  apa: Klüners, J., &#38; Malle, G. (2000). Explicit Galois Realization of Transitive
    Groups of Degree up to 15. <i>Journal of Symbolic Computation</i>, <i>30</i>(6),
    675–716. <a href="https://doi.org/10.1006/jsco.2000.0378">https://doi.org/10.1006/jsco.2000.0378</a>
  bibtex: '@article{Klüners_Malle_2000, title={Explicit Galois Realization of Transitive
    Groups of Degree up to 15}, volume={30}, DOI={<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen and Malle, Gunter}, year={2000}, pages={675–716} }'
  chicago: 'Klüners, Jürgen, and Gunter Malle. “Explicit Galois Realization of Transitive
    Groups of Degree up to 15.” <i>Journal of Symbolic Computation</i> 30, no. 6 (2000):
    675–716. <a href="https://doi.org/10.1006/jsco.2000.0378">https://doi.org/10.1006/jsco.2000.0378</a>.'
  ieee: 'J. Klüners and G. Malle, “Explicit Galois Realization of Transitive Groups
    of Degree up to 15,” <i>Journal of Symbolic Computation</i>, vol. 30, no. 6, pp.
    675–716, 2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>.'
  mla: Klüners, Jürgen, and Gunter Malle. “Explicit Galois Realization of Transitive
    Groups of Degree up to 15.” <i>Journal of Symbolic Computation</i>, vol. 30, no.
    6, Elsevier BV, 2000, pp. 675–716, doi:<a href="https://doi.org/10.1006/jsco.2000.0378">10.1006/jsco.2000.0378</a>.
  short: J. Klüners, G. Malle, Journal of Symbolic Computation 30 (2000) 675–716.
date_created: 2022-12-23T09:57:28Z
date_updated: 2023-03-06T10:48:05Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0378
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 675-716
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: Explicit Galois Realization of Transitive Groups of Degree up to 15
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34898'
abstract:
- lang: eng
  text: We compute a polynomial with Galois group SL₂(11) over ℚ. Furthermore we prove
    that SL₂(11) is the Galois group of a regular extension of ℚ (t).
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Klüners J. A Polynomial with Galois GroupSL2(11). <i>Journal of Symbolic Computation</i>.
    2000;30(6):733-737. doi:<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>
  apa: Klüners, J. (2000). A Polynomial with Galois GroupSL2(11). <i>Journal of Symbolic
    Computation</i>, <i>30</i>(6), 733–737. <a href="https://doi.org/10.1006/jsco.2000.0380">https://doi.org/10.1006/jsco.2000.0380</a>
  bibtex: '@article{Klüners_2000, title={A Polynomial with Galois GroupSL2(11)}, volume={30},
    DOI={<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>},
    number={6}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen}, year={2000}, pages={733–737} }'
  chicago: 'Klüners, Jürgen. “A Polynomial with Galois GroupSL2(11).” <i>Journal of
    Symbolic Computation</i> 30, no. 6 (2000): 733–37. <a href="https://doi.org/10.1006/jsco.2000.0380">https://doi.org/10.1006/jsco.2000.0380</a>.'
  ieee: 'J. Klüners, “A Polynomial with Galois GroupSL2(11),” <i>Journal of Symbolic
    Computation</i>, vol. 30, no. 6, pp. 733–737, 2000, doi: <a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>.'
  mla: Klüners, Jürgen. “A Polynomial with Galois GroupSL2(11).” <i>Journal of Symbolic
    Computation</i>, vol. 30, no. 6, Elsevier BV, 2000, pp. 733–37, doi:<a href="https://doi.org/10.1006/jsco.2000.0380">10.1006/jsco.2000.0380</a>.
  short: J. Klüners, Journal of Symbolic Computation 30 (2000) 733–737.
date_created: 2022-12-23T09:56:52Z
date_updated: 2023-03-06T10:48:40Z
department:
- _id: '102'
doi: 10.1006/jsco.2000.0380
intvolume: '        30'
issue: '6'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 733-737
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: A Polynomial with Galois GroupSL2(11)
type: journal_article
user_id: '93826'
volume: 30
year: '2000'
...
---
_id: '34902'
abstract:
- lang: eng
  text: We present a new polynomial decomposition which generalizes the functional
    and homogeneous bivariate decomposition of irreducible monic polynomials in one
    variable over the rationals. With these decompositions it is possible to calculate
    the roots of an imprimitive polynomial by solving polynomial equations of lower
    degree.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
citation:
  ama: Klüners J. On Polynomial Decompositions. <i>Journal of Symbolic Computation</i>.
    1999;27(3):261-269. doi:<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>
  apa: Klüners, J. (1999). On Polynomial Decompositions. <i>Journal of Symbolic Computation</i>,
    <i>27</i>(3), 261–269. <a href="https://doi.org/10.1006/jsco.1998.0252">https://doi.org/10.1006/jsco.1998.0252</a>
  bibtex: '@article{Klüners_1999, title={On Polynomial Decompositions}, volume={27},
    DOI={<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>},
    number={3}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen}, year={1999}, pages={261–269} }'
  chicago: 'Klüners, Jürgen. “On Polynomial Decompositions.” <i>Journal of Symbolic
    Computation</i> 27, no. 3 (1999): 261–69. <a href="https://doi.org/10.1006/jsco.1998.0252">https://doi.org/10.1006/jsco.1998.0252</a>.'
  ieee: 'J. Klüners, “On Polynomial Decompositions,” <i>Journal of Symbolic Computation</i>,
    vol. 27, no. 3, pp. 261–269, 1999, doi: <a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>.'
  mla: Klüners, Jürgen. “On Polynomial Decompositions.” <i>Journal of Symbolic Computation</i>,
    vol. 27, no. 3, Elsevier BV, 1999, pp. 261–69, doi:<a href="https://doi.org/10.1006/jsco.1998.0252">10.1006/jsco.1998.0252</a>.
  short: J. Klüners, Journal of Symbolic Computation 27 (1999) 261–269.
date_created: 2022-12-23T10:01:15Z
date_updated: 2023-03-06T09:21:29Z
department:
- _id: '102'
doi: 10.1006/jsco.1998.0252
intvolume: '        27'
issue: '3'
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 261-269
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: On Polynomial Decompositions
type: journal_article
user_id: '93826'
volume: 27
year: '1999'
...
---
_id: '34903'
abstract:
- lang: eng
  text: The software packageKANT V4for computations in algebraic number fields is
    now available in version 4. In addition a new user interface has been released.
    We will outline the features of this new software package.
author:
- first_name: M.
  full_name: DABERKOW, M.
  last_name: DABERKOW
- first_name: C.
  full_name: FIEKER, C.
  last_name: FIEKER
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: M.
  full_name: POHST, M.
  last_name: POHST
- first_name: K.
  full_name: ROEGNER, K.
  last_name: ROEGNER
- first_name: M.
  full_name: SCHÖRNIG, M.
  last_name: SCHÖRNIG
- first_name: K.
  full_name: WILDANGER, K.
  last_name: WILDANGER
citation:
  ama: DABERKOW M, FIEKER C, Klüners J, et al. KANT V4. <i>Journal of Symbolic Computation</i>.
    1997;24(3-4):267-283. doi:<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>
  apa: DABERKOW, M., FIEKER, C., Klüners, J., POHST, M., ROEGNER, K., SCHÖRNIG, M.,
    &#38; WILDANGER, K. (1997). KANT V4. <i>Journal of Symbolic Computation</i>, <i>24</i>(3–4),
    267–283. <a href="https://doi.org/10.1006/jsco.1996.0126">https://doi.org/10.1006/jsco.1996.0126</a>
  bibtex: '@article{DABERKOW_FIEKER_Klüners_POHST_ROEGNER_SCHÖRNIG_WILDANGER_1997,
    title={KANT V4}, volume={24}, DOI={<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>},
    number={3–4}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={DABERKOW, M. and FIEKER, C. and Klüners, Jürgen and POHST, M. and ROEGNER,
    K. and SCHÖRNIG, M. and WILDANGER, K.}, year={1997}, pages={267–283} }'
  chicago: 'DABERKOW, M., C. FIEKER, Jürgen Klüners, M. POHST, K. ROEGNER, M. SCHÖRNIG,
    and K. WILDANGER. “KANT V4.” <i>Journal of Symbolic Computation</i> 24, no. 3–4
    (1997): 267–83. <a href="https://doi.org/10.1006/jsco.1996.0126">https://doi.org/10.1006/jsco.1996.0126</a>.'
  ieee: 'M. DABERKOW <i>et al.</i>, “KANT V4,” <i>Journal of Symbolic Computation</i>,
    vol. 24, no. 3–4, pp. 267–283, 1997, doi: <a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>.'
  mla: DABERKOW, M., et al. “KANT V4.” <i>Journal of Symbolic Computation</i>, vol.
    24, no. 3–4, Elsevier BV, 1997, pp. 267–83, doi:<a href="https://doi.org/10.1006/jsco.1996.0126">10.1006/jsco.1996.0126</a>.
  short: M. DABERKOW, C. FIEKER, J. Klüners, M. POHST, K. ROEGNER, M. SCHÖRNIG, K.
    WILDANGER, Journal of Symbolic Computation 24 (1997) 267–283.
date_created: 2022-12-23T10:02:24Z
date_updated: 2023-03-06T09:23:30Z
ddc:
- '000'
department:
- _id: '102'
doi: 10.1006/jsco.1996.0126
has_accepted_license: '1'
intvolume: '        24'
issue: 3-4
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 267-283
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: KANT V4
type: journal_article
user_id: '93826'
volume: 24
year: '1997'
...
---
_id: '34904'
abstract:
- lang: eng
  text: The purpose of this article is to determine all subfields ℚ(β) of fixed degree
    of a given algebraic number field ℚ(α). It is convenient to describe each subfield
    by a pair (h,g) of polynomials in ℚ[t] resp. Z[t] such thatgis the minimal polynomial
    of β = h(α). The computations are done in unramifiedp-adic extensions and use
    information concerning subgroups of the Galois group of the normal closure of
    ℚ(α) obtained from the van der Waerden criterion.
author:
- first_name: Jürgen
  full_name: Klüners, Jürgen
  id: '21202'
  last_name: Klüners
- first_name: Michael
  full_name: Pohst, Michael
  last_name: Pohst
citation:
  ama: Klüners J, Pohst M. On Computing Subfields. <i>Journal of Symbolic Computation</i>.
    1997;24(3-4):385-397. doi:<a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>
  apa: Klüners, J., &#38; Pohst, M. (1997). On Computing Subfields. <i>Journal of
    Symbolic Computation</i>, <i>24</i>(3–4), 385–397. <a href="https://doi.org/10.1006/jsco.1996.0140">https://doi.org/10.1006/jsco.1996.0140</a>
  bibtex: '@article{Klüners_Pohst_1997, title={On Computing Subfields}, volume={24},
    DOI={<a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>},
    number={3–4}, journal={Journal of Symbolic Computation}, publisher={Elsevier BV},
    author={Klüners, Jürgen and Pohst, Michael}, year={1997}, pages={385–397} }'
  chicago: 'Klüners, Jürgen, and Michael Pohst. “On Computing Subfields.” <i>Journal
    of Symbolic Computation</i> 24, no. 3–4 (1997): 385–97. <a href="https://doi.org/10.1006/jsco.1996.0140">https://doi.org/10.1006/jsco.1996.0140</a>.'
  ieee: 'J. Klüners and M. Pohst, “On Computing Subfields,” <i>Journal of Symbolic
    Computation</i>, vol. 24, no. 3–4, pp. 385–397, 1997, doi: <a href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>.'
  mla: Klüners, Jürgen, and Michael Pohst. “On Computing Subfields.” <i>Journal of
    Symbolic Computation</i>, vol. 24, no. 3–4, Elsevier BV, 1997, pp. 385–97, doi:<a
    href="https://doi.org/10.1006/jsco.1996.0140">10.1006/jsco.1996.0140</a>.
  short: J. Klüners, M. Pohst, Journal of Symbolic Computation 24 (1997) 385–397.
date_created: 2022-12-23T10:03:02Z
date_updated: 2023-03-06T10:36:21Z
ddc:
- '000'
department:
- _id: '102'
doi: 10.1006/jsco.1996.0140
has_accepted_license: '1'
intvolume: '        24'
issue: 3-4
keyword:
- Computational Mathematics
- Algebra and Number Theory
language:
- iso: eng
page: 385-397
publication: Journal of Symbolic Computation
publication_identifier:
  issn:
  - 0747-7171
publication_status: published
publisher: Elsevier BV
status: public
title: On Computing Subfields
type: journal_article
user_id: '93826'
volume: 24
year: '1997'
...