The central structure belt in Turpan-Hami basin is composed of the Huoyanshan structure and Qiketai structure formed in late Triassic-early Jurassic, and is characterized by extensional tectonics. The thickness of str...The central structure belt in Turpan-Hami basin is composed of the Huoyanshan structure and Qiketai structure formed in late Triassic-early Jurassic, and is characterized by extensional tectonics. The thickness of strata in the hanging wall of the growth fault is obviously larger than that in the footwall,and a deposition center was evolved in the Taibei sag where the hanging wall of the fault is located. In late Jurassic the collision between Lhasa block and Eurasia continent resulted in the transformation of the Turpan-Hami basin from an extensional structure into a compressional structure, and consequently in the tectonic inversion of the central structure belt of the Turpan-Hami basin from the extensional normal fault in the earlier stage to the compressive thrust fault in the later stage. The Tertiary collision between the Indian plate and the Eurasian plate occurred around 55Ma, and this Himalayan orogenic event has played a profound role in shaping the Tianshan area, only the effect of the collision to this area was delayed since it culminated here approximately in late Oligocene-early Miocene. The central structure belt was strongly deformed and thrusted above the ground as a result of this tectonic event.展开更多
Newton’s iteration is a fundamental tool for numerical solutions of systems of equations. The well-known iteration ?rapidly refines a crude initial approximation X0?to the inverse of a general nonsingular matrix. In ...Newton’s iteration is a fundamental tool for numerical solutions of systems of equations. The well-known iteration ?rapidly refines a crude initial approximation X0?to the inverse of a general nonsingular matrix. In this paper, we will extend and apply this method to n× n?structured matrices M?, in which matrix multiplication has a lower computational cost. These matrices can be represented by their short generators which allow faster computations based on the displacement operators tool. However, the length of the generators is tend to grow and the iterations do not preserve matrix structure. So, the main goal is to control the growth of the length of the short displacement generators so that we can operate with matrices of low rank and carry out the computations much faster. In order to achieve our goal, we will compress the computed approximations to the inverse to yield a superfast algorithm. We will describe two different compression techniques based on the SVD and substitution and we will analyze these approaches. Our main algorithm can be applied to more general classes of structured matrices.展开更多
文摘The central structure belt in Turpan-Hami basin is composed of the Huoyanshan structure and Qiketai structure formed in late Triassic-early Jurassic, and is characterized by extensional tectonics. The thickness of strata in the hanging wall of the growth fault is obviously larger than that in the footwall,and a deposition center was evolved in the Taibei sag where the hanging wall of the fault is located. In late Jurassic the collision between Lhasa block and Eurasia continent resulted in the transformation of the Turpan-Hami basin from an extensional structure into a compressional structure, and consequently in the tectonic inversion of the central structure belt of the Turpan-Hami basin from the extensional normal fault in the earlier stage to the compressive thrust fault in the later stage. The Tertiary collision between the Indian plate and the Eurasian plate occurred around 55Ma, and this Himalayan orogenic event has played a profound role in shaping the Tianshan area, only the effect of the collision to this area was delayed since it culminated here approximately in late Oligocene-early Miocene. The central structure belt was strongly deformed and thrusted above the ground as a result of this tectonic event.
文摘Newton’s iteration is a fundamental tool for numerical solutions of systems of equations. The well-known iteration ?rapidly refines a crude initial approximation X0?to the inverse of a general nonsingular matrix. In this paper, we will extend and apply this method to n× n?structured matrices M?, in which matrix multiplication has a lower computational cost. These matrices can be represented by their short generators which allow faster computations based on the displacement operators tool. However, the length of the generators is tend to grow and the iterations do not preserve matrix structure. So, the main goal is to control the growth of the length of the short displacement generators so that we can operate with matrices of low rank and carry out the computations much faster. In order to achieve our goal, we will compress the computed approximations to the inverse to yield a superfast algorithm. We will describe two different compression techniques based on the SVD and substitution and we will analyze these approaches. Our main algorithm can be applied to more general classes of structured matrices.
