ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (11)
  • Other Sources
  • Mathematical programming  (5)
  • data processing  (5)
  • simulation
  • Springer  (11)
  • 1995-1999
  • 1990-1994
  • 1985-1989
  • 1975-1979  (11)
  • 1970-1974
  • 1975  (11)
  • Mathematics  (11)
  • Technology
  • Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
Collection
  • Articles  (11)
  • Other Sources
Publisher
  • Springer  (11)
Years
  • 1995-1999
  • 1990-1994
  • 1985-1989
  • 1975-1979  (11)
  • 1970-1974
Year
Topic
  • Mathematics  (11)
  • Technology
  • Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
  • Geosciences  (6)
  • Computer Science  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 7 (1975), S. 363-371 
    ISSN: 1573-8868
    Keywords: data processing ; geochemistry ; petrology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract An information system is needed to restore access to published information, now so voluminous that suitable levels of familiarity with it cannot be maintained by conventional nonelectronic scholarly devices. The services of the system should be available to petrologists via mail or remote terminal, and should provide, as requested, either retrieval or reduction of data contained in its base. The base should contain chemical, geological, mineralogical, and petrographic information about specimens for which full descriptions have been published. Provisional plans for construction of such a base are briefly reviewed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 7 (1975), S. 117-128 
    ISSN: 1573-8868
    Keywords: data processing ; lognormal theory ; sampling ; simulation ; statistics ; transformations ; economic geology ; mining ; sedimentology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract A logarithmic transformation may be used to improve the efficiency of estimates of the mean when observations follow the lognormal distribution. But if this transformation is applied to observations that follow another distribution, bias may be introduced. We consider some consequences of erroneously applying lognormal estimation theory and demonstrate that biased estimates may be obtained for certain classes of distributions. Illustrations of bias obtained in gold sampling are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 7 (1975), S. 285-293 
    ISSN: 1573-8868
    Keywords: cluster analysis ; data processing ; orientation data ; statistics ; structure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract A method of cluster analysis for orientation data is described. The method enables vector statistics to be applied to polymodal distributions. Similar results to those found by modal analysis are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 7 (1975), S. 295-321 
    ISSN: 1573-8868
    Keywords: data processing ; data structure ; independent events ; paleontology ; petrology ; regional mapping ; stratigraphy ; structure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Geological events, such as emplacement of granite or growth of slaty cleavage, may be ordered into a sequence by two methods. One is to assign each event a place in a time scale, such as years before the present, which amounts to assigning events an age designation from the set of real numbers. In ordering such a list, the algebra of real numbers applies. A second method is to determine the time relations of events in pairs, such as a fold is of type (S1, S2) or granite intrudes conglomerate. These binary relations between events may be used to order events into a sequence using the transitive properties of the relation “older than.” It is shown, however, that the binary relations between events do not follow the familiar rules for the algebra of real or integral numbers and it is necessary to erect a new system of relations called the “algebra of events.” The fundamental relation is “older than or equivalent to” and this may be used to define the relations “older than”, “younger than”, “equivalent to”, “incomparable to”, and “covers.” The essential difference from the algebra of integers is that the reflexive relation (“equal to”) is replaced by two such relations (“equivalent to” and “incomparable to”) in the algebra of events. A number of binary relations between events may be assembled into an event matrix which is basically a truth table for the relation “older than.” This may be ordered and stacked by operations termed ORDER and STACK. The relationship of each event to every other event may be determined by simple inspection of an ordered, stacked matrix, and from this a geological history may be assembled. If there are contradictions in the field data, ordering into a proper sequence is impossible and may be detected. If there are ambiguities in the field data, there are several different orders that are proper sequences so that the event matrix may be ordered. However, the ambiguities occur as voids in the stacked matrix.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 7 (1975), S. 47-61 
    ISSN: 1573-8868
    Keywords: Markov processes ; simulation ; cyclothems ; stratigraphy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract The Banff Formation (Mississippian) is a sequence of limestone and shale exposed in the southern Canadian Rocky Mountains and underlying the adjacent plains. It was chosen as a vehicle to evaluate Markov-inspired techniques in sedimentary sequences where repetition of rock types is typical but a pattern of cyclicity is not obvious. Distributions of rock-unit thickness in two outcrop sections of the Banff Formation are not all exponential, therefore a one-step Markov model using an equal observational interval is not valid. Memory is indicated by the embedded-chain model. The most likely pattern of recurrence is delineated; shale is the most independent lithologic type and therefore the initial lithology in any ideal pattern. Neither factoring nor powering a probability matrix for the Banff Formation revealed geological cyclicity as defined by W. Schwarzacher. Several problems limit the application of Markov models to sedimentary sequences. Statistical validity requires a minimum number of observations, and in the attainment of a sound statistical basis, geological pertinence may be seriously reduced. Treatment of the probability matrix, by principal components analysis or by powering, yields an exacting criterion for cyclicity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1573-8868
    Keywords: data processing ; discriminant analysis ; graphics ; mapping ; sampling ; simulation ; geochemistry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract The exploration geochemist faces a serious problem in reconciling theoretical statistics with the empirical distribution of elements in materials in the earth's crust. The results of computer-simulation experiments being conducted by the Exploration Geochemistry Group at the University of New Brunswick illustrate some of the problems of the relation between frequency distributions and spatial distributions of elements and raise some interesting questions about sampling patterns and physical size of samples. Most importantly, the simulation experiments and empirical examples support the contention that attempts to make an assumption of normality more efficient by performing log transformations on positively skewed data may defeat the purpose of statistical analysis for exploration work. New developments in computer-data presentation and interpretation, including population sorting and classification, illustrate the increasing use of the computer in exploration geochemistry.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 25-38 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; quadratically convergent algorithms ; conjugate-direction methods ; linearly constrained nonlinear programming ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An iterative procedure is presented which uses conjugate directions to minimize a nonlinear function subject to linear inequality constraints. The method (i) converges to a stationary point assuming only first-order differentiability, (ii) has ann-q step superlinear or quadratic rate of convergence with stronger assumptions (n is the number of variables,q is the number of constraints which are binding at the optimum), (iii) requires the computation of only the objective function and its first derivatives, and (iv) is experimentally competitive with well-known methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 155-161 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; method of multipliers ; penalty function methods ; inequality constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the numerical solution of the general mathematical programming problem of minimizing a scalar functionf(x) subject to the vector constraints φ(x)=0 and ψ(x)≥0. The approach used is an extension of the Hestenes method of multipliers, which deals with the equality constraints only. The above problem is replaced by a sequence of problems of minimizing the augmented penalty function Ω(x, λ, μ,k)=f(x)+λ T φ(x)+kφ T (x)φ(x) −μ T $$\tilde \psi $$ (x)+k $$\tilde \psi $$ T (x) $$\tilde \psi $$ (x). The vectors λ and μ, μ ≥ 0, are respectively the Lagrange multipliers for φ(x) and $$\tilde \psi $$ (x), and the elements of $$\tilde \psi $$ (x) are defined by $$\tilde \psi $$ (j)(x)=min[ψ(j)(x), (1/2k) μ(j)]. The scalark〉0 is the penalty constant, held fixed throughout the algorithm. Rules are given for updating the multipliers for each minimization cycle. Justification is given for trusting that the sequence of minimizing points will converge to the solution point of the original problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 181-183 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; absolute-value problems ; optimality criteria ; linear programming ; nonconvex programming ; operations research
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper considers some programming problems with absolute-value (objective) functions subject to linear constraints. Necessary and sufficient conditions for the existence of finite optimum solutions to these problems are proved.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 229-238 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; converse duality ; Banach spaces ; convexity ; optimal control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two theorems on converse duality are obtained for mathematical programs in Banach spaces. The proofs are based on a Banach-space generalization of the F. John necessary condition for a constrained minimum. No use is made of Kuhn-Tucker constraint qualifications. In the second theorem, the primal program contains a nonlinear equality constraint, and a converse duality theorem is obtained, using a modified concept of convexity; this result appears new, even for finite-dimensional programs. The results are applied to a problem in optimal control.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 429-445 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; conjugate-gradient methods ; variable-metric methods ; linear equations ; numerical methods ; computing methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A computationally stable method for the general solution of a system of linear equations is given. The system isA Tx−B=0, where then-vectorx is unknown and then×q matrixA and theq-vectorB are known. It is assumed that the matrixA T and the augmented matrix [A T,B] are of the same rankm, wherem≤n, so that the system is consistent and solvable. Whenm〈n, the method yields the minimum modulus solutionx m and a symmetricn ×n matrixH m of rankn−m, so thatx=x m+H my satisfies the system for ally, ann-vector. Whenm=n, the matrixH m reduces to zero andx m becomes the unique solution of the system. The method is also suitable for the solution of a determined system ofn linear equations. When then×n coefficient matrix is ill-conditioned, the method can produce a good solution, while the commonly used elimination method fails.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...